./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.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 dba6b0ef25bae7761b43c0e245fa504288384a8042fc35bb9e63270387c5de2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:02:39,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:02:39,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:02:39,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:02:39,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:02:39,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:02:39,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:02:39,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:02:39,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:02:39,870 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:02:39,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:02:39,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:02:39,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:02:39,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:02:39,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:02:39,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:02:39,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:02:39,873 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:02:39,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:02:39,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:02:39,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:02:39,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:02:39,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:02:39,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:02:39,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:02:39,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:02:39,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:02:39,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:02:39,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:02:39,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:02:39,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:02:39,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:02:39,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:02:39,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:02:39,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:02:39,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:02:39,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:02:39,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:02:39,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:02:39,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:02:39,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:02:39,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:02:39,880 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 -> dba6b0ef25bae7761b43c0e245fa504288384a8042fc35bb9e63270387c5de2b [2024-10-13 05:02:40,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:02:40,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:02:40,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:02:40,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:02:40,201 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:02:40,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i [2024-10-13 05:02:41,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:02:41,881 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:02:41,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i [2024-10-13 05:02:41,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8596624cf/fc93d93cb57a41a08b468c3580c8af54/FLAG15be05b7e [2024-10-13 05:02:42,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8596624cf/fc93d93cb57a41a08b468c3580c8af54 [2024-10-13 05:02:42,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:02:42,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:02:42,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:02:42,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:02:42,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:02:42,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5309a91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42, skipping insertion in model container [2024-10-13 05:02:42,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:02:42,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i[915,928] [2024-10-13 05:02:42,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:02:42,493 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:02:42,504 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-89.i[915,928] [2024-10-13 05:02:42,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:02:42,539 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:02:42,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42 WrapperNode [2024-10-13 05:02:42,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:02:42,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:02:42,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:02:42,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:02:42,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,590 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-10-13 05:02:42,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:02:42,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:02:42,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:02:42,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:02:42,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,622 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:02:42,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:02:42,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:02:42,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:02:42,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:02:42,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (1/1) ... [2024-10-13 05:02:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:02:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:02:42,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:02:42,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:02:42,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:02:42,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:02:42,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:02:42,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:02:42,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:02:42,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:02:42,808 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:02:42,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:02:43,021 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 05:02:43,022 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:02:43,070 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:02:43,070 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:02:43,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:02:43 BoogieIcfgContainer [2024-10-13 05:02:43,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:02:43,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:02:43,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:02:43,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:02:43,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:02:42" (1/3) ... [2024-10-13 05:02:43,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426cffa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:02:43, skipping insertion in model container [2024-10-13 05:02:43,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:02:42" (2/3) ... [2024-10-13 05:02:43,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426cffa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:02:43, skipping insertion in model container [2024-10-13 05:02:43,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:02:43" (3/3) ... [2024-10-13 05:02:43,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-89.i [2024-10-13 05:02:43,100 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:02:43,100 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:02:43,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:02:43,186 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;@4f5861e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:02:43,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:02:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:02:43,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:02:43,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:02:43,206 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:02:43,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:02:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:02:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1579794454, now seen corresponding path program 1 times [2024-10-13 05:02:43,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:02:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942331227] [2024-10-13 05:02:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:02:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:02:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:02:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:02:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:02:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:02:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:02:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:02:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:02:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:02:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:02:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:02:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:02:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:02:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:02:43,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:02:43,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942331227] [2024-10-13 05:02:43,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942331227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:02:43,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:02:43,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:02:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701355800] [2024-10-13 05:02:43,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:02:43,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:02:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:02:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:02:43,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:02:43,606 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:02:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:02:43,647 INFO L93 Difference]: Finished difference Result 61 states and 104 transitions. [2024-10-13 05:02:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:02:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2024-10-13 05:02:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:02:43,666 INFO L225 Difference]: With dead ends: 61 [2024-10-13 05:02:43,667 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 05:02:43,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:02:43,677 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:02:43,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:02:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 05:02:43,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 05:02:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:02:43,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2024-10-13 05:02:43,714 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 72 [2024-10-13 05:02:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:02:43,715 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2024-10-13 05:02:43,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:02:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2024-10-13 05:02:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:02:43,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:02:43,718 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:02:43,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:02:43,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:02:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:02:43,720 INFO L85 PathProgramCache]: Analyzing trace with hash 67442666, now seen corresponding path program 1 times [2024-10-13 05:02:43,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:02:43,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461477525] [2024-10-13 05:02:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:02:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:02:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:02:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:02:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:02:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:02:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:02:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:02:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:02:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:02:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:02:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:02:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:02:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:02:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:02:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:02:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461477525] [2024-10-13 05:02:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461477525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:02:44,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:02:44,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:02:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058178728] [2024-10-13 05:02:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:02:44,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:02:44,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:02:44,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:02:44,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:02:44,923 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:02:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:02:45,209 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-10-13 05:02:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:02:45,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 72 [2024-10-13 05:02:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:02:45,214 INFO L225 Difference]: With dead ends: 57 [2024-10-13 05:02:45,215 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 05:02:45,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:02:45,218 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:02:45,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 155 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:02:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 05:02:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-10-13 05:02:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:02:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-10-13 05:02:45,255 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 72 [2024-10-13 05:02:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:02:45,256 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-10-13 05:02:45,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:02:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-10-13 05:02:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:02:45,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:02:45,261 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:02:45,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:02:45,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:02:45,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:02:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 67502248, now seen corresponding path program 1 times [2024-10-13 05:02:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:02:45,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102074573] [2024-10-13 05:02:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:02:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:02:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:02:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:02:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:02:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:02:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:02:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:02:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:02:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:02:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:02:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:02:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 05:02:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 05:02:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:02:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:02:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:02:45,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102074573] [2024-10-13 05:02:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102074573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:02:45,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:02:45,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:02:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064593764] [2024-10-13 05:02:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:02:45,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:02:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:02:45,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:02:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:02:45,926 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:02:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:02:46,084 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2024-10-13 05:02:46,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:02:46,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 72 [2024-10-13 05:02:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:02:46,087 INFO L225 Difference]: With dead ends: 53 [2024-10-13 05:02:46,087 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 05:02:46,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:02:46,091 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:02:46,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:02:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 05:02:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 05:02:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 05:02:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 05:02:46,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-13 05:02:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:02:46,094 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 05:02:46,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:02:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 05:02:46,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 05:02:46,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:02:46,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:02:46,102 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 05:02:46,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 05:02:46,299 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:02:46,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:02:46 BoogieIcfgContainer [2024-10-13 05:02:46,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:02:46,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:02:46,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:02:46,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:02:46,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:02:43" (3/4) ... [2024-10-13 05:02:46,321 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 05:02:46,325 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 05:02:46,329 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 05:02:46,330 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 05:02:46,330 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 05:02:46,331 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 05:02:46,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 05:02:46,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 05:02:46,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:02:46,429 INFO L158 Benchmark]: Toolchain (without parser) took 4203.34ms. Allocated memory was 123.7MB in the beginning and 213.9MB in the end (delta: 90.2MB). Free memory was 71.0MB in the beginning and 171.0MB in the end (delta: -100.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:02:46,430 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:02:46,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.86ms. Allocated memory was 123.7MB in the beginning and 178.3MB in the end (delta: 54.5MB). Free memory was 70.7MB in the beginning and 147.8MB in the end (delta: -77.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-13 05:02:46,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.68ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 145.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:02:46,432 INFO L158 Benchmark]: Boogie Preprocessor took 43.51ms. Allocated memory is still 178.3MB. Free memory was 145.8MB in the beginning and 142.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:02:46,432 INFO L158 Benchmark]: RCFGBuilder took 435.15ms. Allocated memory is still 178.3MB. Free memory was 142.4MB in the beginning and 126.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:02:46,432 INFO L158 Benchmark]: TraceAbstraction took 3242.55ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.4MB in the beginning and 176.2MB in the end (delta: -49.8MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2024-10-13 05:02:46,433 INFO L158 Benchmark]: Witness Printer took 111.31ms. Allocated memory is still 213.9MB. Free memory was 176.2MB in the beginning and 171.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:02:46,434 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.17ms. Allocated memory is still 123.7MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.86ms. Allocated memory was 123.7MB in the beginning and 178.3MB in the end (delta: 54.5MB). Free memory was 70.7MB in the beginning and 147.8MB in the end (delta: -77.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.68ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 145.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.51ms. Allocated memory is still 178.3MB. Free memory was 145.8MB in the beginning and 142.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 435.15ms. Allocated memory is still 178.3MB. Free memory was 142.4MB in the beginning and 126.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3242.55ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 126.4MB in the beginning and 176.2MB in the end (delta: -49.8MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. * Witness Printer took 111.31ms. Allocated memory is still 213.9MB. Free memory was 176.2MB in the beginning and 171.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 308 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 129 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 681 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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: 68]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-13 05:02:46,468 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