./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_amount25_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:41:03,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:41:03,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:41:03,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:41:03,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:41:03,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:41:03,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:41:03,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:41:03,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:41:03,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:41:03,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:41:03,695 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:41:03,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:41:03,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:41:03,697 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:41:03,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:41:03,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:41:03,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:41:03,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:41:03,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:41:03,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:41:03,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:41:03,706 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:41:03,706 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:41:03,706 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:41:03,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:41:03,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:41:03,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:41:03,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:41:03,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:41:03,708 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:41:03,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:41:03,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:41:03,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:41:03,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:41:03,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:41:03,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:41:03,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:41:03,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:41:03,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:41:03,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:41:03,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:41:03,712 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-clean/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-clean/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 -> 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 [2024-10-11 12:41:04,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:41:04,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:41:04,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:41:04,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:41:04,094 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:41:04,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2024-10-11 12:41:05,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:41:05,768 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:41:05,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2024-10-11 12:41:05,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc6097d76/5b32ae32cdb4453c8c1cc4ddebf1ff4b/FLAGd03f46fb5 [2024-10-11 12:41:05,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc6097d76/5b32ae32cdb4453c8c1cc4ddebf1ff4b [2024-10-11 12:41:05,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:41:05,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:41:05,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:41:05,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:41:05,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:41:05,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:41:05" (1/1) ... [2024-10-11 12:41:05,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b365c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:05, skipping insertion in model container [2024-10-11 12:41:05,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:41:05" (1/1) ... [2024-10-11 12:41:05,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:41:06,024 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_amount25_file-9.i[914,927] [2024-10-11 12:41:06,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:41:06,072 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:41:06,083 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_amount25_file-9.i[914,927] [2024-10-11 12:41:06,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:41:06,119 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:41:06,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06 WrapperNode [2024-10-11 12:41:06,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:41:06,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:41:06,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:41:06,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:41:06,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,170 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-10-11 12:41:06,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:41:06,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:41:06,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:41:06,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:41:06,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,206 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-11 12:41:06,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:41:06,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:41:06,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:41:06,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:41:06,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (1/1) ... [2024-10-11 12:41:06,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:41:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:41:06,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:41:06,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:41:06,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:41:06,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:41:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:41:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:41:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:41:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:41:06,439 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:41:06,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:41:06,777 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 12:41:06,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:41:06,828 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:41:06,829 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:41:06,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:06 BoogieIcfgContainer [2024-10-11 12:41:06,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:41:06,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:41:06,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:41:06,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:41:06,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:41:05" (1/3) ... [2024-10-11 12:41:06,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249cef55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:41:06, skipping insertion in model container [2024-10-11 12:41:06,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:06" (2/3) ... [2024-10-11 12:41:06,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249cef55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:41:06, skipping insertion in model container [2024-10-11 12:41:06,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:06" (3/3) ... [2024-10-11 12:41:06,843 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-9.i [2024-10-11 12:41:06,861 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:41:06,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:41:06,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:41:06,932 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;@7e6d65a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:41:06,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:41:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 12:41:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 12:41:06,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:06,947 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 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-11 12:41:06,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:06,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash -191605738, now seen corresponding path program 1 times [2024-10-11 12:41:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:41:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691656683] [2024-10-11 12:41:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:41:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:41:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:41:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:41:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:41:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:41:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 12:41:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:41:07,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691656683] [2024-10-11 12:41:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691656683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:07,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:07,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:41:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701890619] [2024-10-11 12:41:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:07,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:41:07,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:41:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:41:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:41:07,214 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 12:41:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:07,241 INFO L93 Difference]: Finished difference Result 67 states and 103 transitions. [2024-10-11 12:41:07,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:41:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2024-10-11 12:41:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:07,257 INFO L225 Difference]: With dead ends: 67 [2024-10-11 12:41:07,259 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 12:41:07,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-11 12:41:07,268 INFO L432 NwaCegarLoop]: 42 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, 42 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-11 12:41:07,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:41:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 12:41:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 12:41:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 12:41:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-10-11 12:41:07,317 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 41 [2024-10-11 12:41:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:07,317 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-10-11 12:41:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 12:41:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-10-11 12:41:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 12:41:07,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:07,319 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 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-11 12:41:07,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:41:07,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:07,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash -52436840, now seen corresponding path program 1 times [2024-10-11 12:41:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:41:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27924002] [2024-10-11 12:41:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:41:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:41:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:41:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:41:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:41:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:41:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 12:41:07,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:41:07,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27924002] [2024-10-11 12:41:07,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27924002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:07,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:07,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:41:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7777877] [2024-10-11 12:41:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:07,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:41:07,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:41:07,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:41:07,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:41:07,655 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:07,759 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2024-10-11 12:41:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:41:07,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-10-11 12:41:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:07,765 INFO L225 Difference]: With dead ends: 110 [2024-10-11 12:41:07,766 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 12:41:07,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:41:07,769 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:41:07,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:41:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 12:41:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2024-10-11 12:41:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 12:41:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2024-10-11 12:41:07,794 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 41 [2024-10-11 12:41:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:07,795 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2024-10-11 12:41:07,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2024-10-11 12:41:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 12:41:07,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:07,797 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 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-11 12:41:07,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:41:07,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:07,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1411701762, now seen corresponding path program 1 times [2024-10-11 12:41:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:41:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053697860] [2024-10-11 12:41:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:07,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:41:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:41:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:41:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:41:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:41:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:41:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 12:41:07,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:41:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053697860] [2024-10-11 12:41:08,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053697860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:08,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:08,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:41:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925037014] [2024-10-11 12:41:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:08,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:41:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:41:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:41:08,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:41:08,007 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:08,057 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2024-10-11 12:41:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:41:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2024-10-11 12:41:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:08,060 INFO L225 Difference]: With dead ends: 142 [2024-10-11 12:41:08,060 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 12:41:08,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:41:08,064 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 41 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:41:08,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 77 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:41:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 12:41:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2024-10-11 12:41:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 12:41:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2024-10-11 12:41:08,092 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 42 [2024-10-11 12:41:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2024-10-11 12:41:08,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-10-11 12:41:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 12:41:08,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:08,095 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 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-11 12:41:08,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:41:08,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:08,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2111706310, now seen corresponding path program 1 times [2024-10-11 12:41:08,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:41:08,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488798275] [2024-10-11 12:41:08,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:08,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:41:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:08,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:41:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:08,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:41:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:08,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:41:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:08,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:41:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:08,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:41:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 12:41:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:41:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488798275] [2024-10-11 12:41:08,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488798275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:08,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:08,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:41:08,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117378924] [2024-10-11 12:41:08,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:08,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:41:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:41:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:41:08,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:41:08,628 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:08,700 INFO L93 Difference]: Finished difference Result 126 states and 166 transitions. [2024-10-11 12:41:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:41:08,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2024-10-11 12:41:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:08,702 INFO L225 Difference]: With dead ends: 126 [2024-10-11 12:41:08,702 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 12:41:08,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:41:08,704 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:41:08,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:41:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 12:41:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2024-10-11 12:41:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 12:41:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-10-11 12:41:08,718 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 43 [2024-10-11 12:41:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:08,719 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-10-11 12:41:08,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-10-11 12:41:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 12:41:08,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:08,721 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 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-11 12:41:08,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:41:08,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1111343337, now seen corresponding path program 1 times [2024-10-11 12:41:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:41:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772790805] [2024-10-11 12:41:08,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:08,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:41:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:41:08,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [791314261] [2024-10-11 12:41:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:08,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:41:08,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:41:08,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:41:08,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:41:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:41:08,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:41:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:41:08,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:41:08,943 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:41:08,945 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:41:08,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:41:09,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:41:09,154 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 12:41:09,212 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:41:09,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:41:09 BoogieIcfgContainer [2024-10-11 12:41:09,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:41:09,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:41:09,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:41:09,218 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:41:09,219 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:06" (3/4) ... [2024-10-11 12:41:09,223 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:41:09,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:41:09,226 INFO L158 Benchmark]: Toolchain (without parser) took 3425.54ms. Allocated memory is still 186.6MB. Free memory was 136.9MB in the beginning and 75.2MB in the end (delta: 61.7MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2024-10-11 12:41:09,226 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:41:09,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.82ms. Allocated memory is still 186.6MB. Free memory was 136.9MB in the beginning and 123.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:41:09,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.77ms. Allocated memory is still 186.6MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:41:09,229 INFO L158 Benchmark]: Boogie Preprocessor took 55.26ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 117.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:41:09,230 INFO L158 Benchmark]: RCFGBuilder took 599.34ms. Allocated memory is still 186.6MB. Free memory was 117.3MB in the beginning and 144.2MB in the end (delta: -27.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 12:41:09,230 INFO L158 Benchmark]: TraceAbstraction took 2384.74ms. Allocated memory is still 186.6MB. Free memory was 143.2MB in the beginning and 75.2MB in the end (delta: 68.0MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. [2024-10-11 12:41:09,230 INFO L158 Benchmark]: Witness Printer took 7.50ms. Allocated memory is still 186.6MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:41:09,231 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.16ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 62.5MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.82ms. Allocated memory is still 186.6MB. Free memory was 136.9MB in the beginning and 123.6MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.77ms. Allocated memory is still 186.6MB. Free memory was 122.9MB in the beginning and 120.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.26ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 117.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 599.34ms. Allocated memory is still 186.6MB. Free memory was 117.3MB in the beginning and 144.2MB in the end (delta: -27.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2384.74ms. Allocated memory is still 186.6MB. Free memory was 143.2MB in the beginning and 75.2MB in the end (delta: 68.0MB). Peak memory consumption was 66.9MB. Max. memory is 16.1GB. * Witness Printer took 7.50ms. Allocated memory is still 186.6MB. Free memory is still 75.2MB. There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of shiftLeft at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed short int last_1_var_1_8 = 100; [L31] double last_1_var_1_10 = 9.2; [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] CALL updateLastVariables() [L71] last_1_var_1_8 = var_1_8 [L72] last_1_var_1_10 = var_1_10 [L82] RET updateLastVariables() [L83] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L62] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L63] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L63] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L64] var_1_7 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L65] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L66] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L67] var_1_11 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L68] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L83] RET updateVariables() [L84] CALL step() [L35] COND FALSE !(last_1_var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L38] COND FALSE !(((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) [L45] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=64] [L50] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=64] [L50] COND TRUE (10 << var_1_9) < (var_1_3 * var_1_1) [L51] var_1_8 = (var_1_9 + var_1_1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L53] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, stepLocal_0=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L54] COND TRUE ((var_1_1 + var_1_9) < 10) || stepLocal_0 [L55] var_1_12 = ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L84] RET step() [L85] CALL, EXPR property() [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75-L76] return (((((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((var_1_1 + var_1_9) < 10) || (var_1_10 > var_1_10)) ? (var_1_12 == ((signed short int) ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))))) : (var_1_12 == ((signed short int) var_1_8))) ; [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 182 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=2, InterpolantAutomatonStates: 13, 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, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 160/160 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:41:09,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:41:11,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:41:11,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:41:11,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:41:11,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:41:11,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:41:11,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:41:11,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:41:11,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:41:11,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:41:11,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:41:11,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:41:11,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:41:11,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:41:11,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:41:11,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:41:11,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:41:11,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:41:11,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:41:11,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:41:11,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:41:11,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:41:11,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:41:11,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:41:11,757 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:41:11,757 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:41:11,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:41:11,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:41:11,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:41:11,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:41:11,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:41:11,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:41:11,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:41:11,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:41:11,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:41:11,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:41:11,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:41:11,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:41:11,762 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:41:11,762 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:41:11,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:41:11,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:41:11,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:41:11,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:41:11,764 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:41:11,764 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-clean/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-clean/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 -> 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 [2024-10-11 12:41:12,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:41:12,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:41:12,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:41:12,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:41:12,157 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:41:12,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2024-10-11 12:41:13,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:41:13,982 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:41:13,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2024-10-11 12:41:13,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8051aa804/ee945046061240a7bf21abce7e5c670d/FLAG1aedac331 [2024-10-11 12:41:14,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8051aa804/ee945046061240a7bf21abce7e5c670d [2024-10-11 12:41:14,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:41:14,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:41:14,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:41:14,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:41:14,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:41:14,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597a4299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14, skipping insertion in model container [2024-10-11 12:41:14,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:41:14,213 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_amount25_file-9.i[914,927] [2024-10-11 12:41:14,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:41:14,284 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:41:14,300 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_amount25_file-9.i[914,927] [2024-10-11 12:41:14,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:41:14,344 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:41:14,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14 WrapperNode [2024-10-11 12:41:14,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:41:14,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:41:14,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:41:14,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:41:14,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,407 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 75 [2024-10-11 12:41:14,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:41:14,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:41:14,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:41:14,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:41:14,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,447 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-11 12:41:14,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:41:14,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:41:14,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:41:14,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:41:14,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (1/1) ... [2024-10-11 12:41:14,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:41:14,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:41:14,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:41:14,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:41:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:41:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:41:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:41:14,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:41:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:41:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:41:14,659 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:41:14,661 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:41:14,905 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:41:14,906 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:41:14,965 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:41:14,967 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:41:14,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:14 BoogieIcfgContainer [2024-10-11 12:41:14,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:41:14,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:41:14,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:41:14,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:41:14,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:41:14" (1/3) ... [2024-10-11 12:41:14,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6deff819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:41:14, skipping insertion in model container [2024-10-11 12:41:14,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:41:14" (2/3) ... [2024-10-11 12:41:14,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6deff819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:41:14, skipping insertion in model container [2024-10-11 12:41:14,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:14" (3/3) ... [2024-10-11 12:41:14,979 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-9.i [2024-10-11 12:41:14,997 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:41:14,997 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:41:15,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:41:15,079 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;@4ef69d0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:41:15,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:41:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 12:41:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 12:41:15,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:15,095 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11 12:41:15,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:15,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1196541095, now seen corresponding path program 1 times [2024-10-11 12:41:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:41:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414309989] [2024-10-11 12:41:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:15,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:41:15,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:41:15,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:41:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:15,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:41:15,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:41:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 12:41:15,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:41:15,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:41:15,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414309989] [2024-10-11 12:41:15,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414309989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:15,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:15,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:41:15,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106114371] [2024-10-11 12:41:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:15,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:41:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:41:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:41:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:41:15,326 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:15,362 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2024-10-11 12:41:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:41:15,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2024-10-11 12:41:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:15,374 INFO L225 Difference]: With dead ends: 52 [2024-10-11 12:41:15,374 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 12:41:15,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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-11 12:41:15,382 INFO L432 NwaCegarLoop]: 29 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, 29 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-11 12:41:15,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:41:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 12:41:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-11 12:41:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 12:41:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-11 12:41:15,420 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 38 [2024-10-11 12:41:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:15,420 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-11 12:41:15,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-11 12:41:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 12:41:15,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:15,424 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11 12:41:15,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:41:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:15,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1300771305, now seen corresponding path program 1 times [2024-10-11 12:41:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:41:15,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079159318] [2024-10-11 12:41:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:15,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:15,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:41:15,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:41:15,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:41:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:15,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 12:41:15,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:41:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 12:41:15,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:41:15,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:41:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079159318] [2024-10-11 12:41:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079159318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:41:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730147546] [2024-10-11 12:41:15,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:15,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:41:15,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:41:15,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:41:15,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:41:15,916 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:16,072 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-10-11 12:41:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:41:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2024-10-11 12:41:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:16,075 INFO L225 Difference]: With dead ends: 81 [2024-10-11 12:41:16,075 INFO L226 Difference]: Without dead ends: 57 [2024-10-11 12:41:16,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:41:16,078 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:41:16,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 86 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:41:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-11 12:41:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2024-10-11 12:41:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 12:41:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2024-10-11 12:41:16,096 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 38 [2024-10-11 12:41:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:16,098 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2024-10-11 12:41:16,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2024-10-11 12:41:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 12:41:16,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:16,100 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11 12:41:16,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:41:16,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:16,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:16,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:16,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1334005633, now seen corresponding path program 1 times [2024-10-11 12:41:16,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:41:16,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629542558] [2024-10-11 12:41:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:16,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:16,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:41:16,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:41:16,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:41:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:16,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 12:41:16,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:41:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 12:41:16,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:41:16,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:41:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629542558] [2024-10-11 12:41:16,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629542558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:41:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166611353] [2024-10-11 12:41:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:41:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:41:16,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:41:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:41:16,503 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:16,624 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2024-10-11 12:41:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:41:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2024-10-11 12:41:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:16,628 INFO L225 Difference]: With dead ends: 109 [2024-10-11 12:41:16,628 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 12:41:16,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:41:16,630 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:41:16,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:41:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 12:41:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2024-10-11 12:41:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 12:41:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-10-11 12:41:16,654 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 39 [2024-10-11 12:41:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:16,655 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-10-11 12:41:16,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2024-10-11 12:41:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 12:41:16,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:16,656 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11 12:41:16,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 12:41:16,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:16,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:16,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1334065215, now seen corresponding path program 1 times [2024-10-11 12:41:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:41:16,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671888103] [2024-10-11 12:41:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:16,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:41:16,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:41:16,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:41:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:16,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 12:41:16,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:41:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 12:41:23,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:41:23,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:41:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671888103] [2024-10-11 12:41:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671888103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:23,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:41:23,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958899940] [2024-10-11 12:41:23,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:23,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 12:41:23,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:41:23,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 12:41:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:41:23,264 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:23,995 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-10-11 12:41:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:41:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2024-10-11 12:41:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:24,004 INFO L225 Difference]: With dead ends: 68 [2024-10-11 12:41:24,006 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 12:41:24,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2024-10-11 12:41:24,009 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:41:24,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 64 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:41:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 12:41:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2024-10-11 12:41:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 12:41:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2024-10-11 12:41:24,028 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 39 [2024-10-11 12:41:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:24,029 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2024-10-11 12:41:24,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2024-10-11 12:41:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 12:41:24,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:41:24,033 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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-11 12:41:24,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 12:41:24,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:24,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:41:24,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:41:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1391323517, now seen corresponding path program 1 times [2024-10-11 12:41:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:41:24,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129137525] [2024-10-11 12:41:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:41:24,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:41:24,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:41:24,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 12:41:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:41:24,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 12:41:24,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:41:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 12:41:27,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:41:27,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:41:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129137525] [2024-10-11 12:41:27,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129137525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:41:27,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:41:27,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 12:41:27,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594450424] [2024-10-11 12:41:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:41:27,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 12:41:27,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:41:27,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 12:41:27,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:41:27,061 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:41:27,608 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-10-11 12:41:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:41:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2024-10-11 12:41:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:41:27,609 INFO L225 Difference]: With dead ends: 66 [2024-10-11 12:41:27,609 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:41:27,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2024-10-11 12:41:27,611 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:41:27,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 59 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:41:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:41:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:41:27,613 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-11 12:41:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:41:27,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-10-11 12:41:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:41:27,613 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:41:27,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 12:41:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:41:27,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:41:27,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:41:27,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 12:41:27,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:41:27,821 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 12:41:27,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:41:29,015 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:41:29,028 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,029 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,031 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,031 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,032 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:41:29,032 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,032 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,032 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,032 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,032 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,033 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:41:29,033 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,040 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:41:29,041 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,041 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:41:29,041 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,041 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:41:29,042 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,042 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:41:29,042 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:41:29,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:41:29 BoogieIcfgContainer [2024-10-11 12:41:29,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:41:29,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:41:29,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:41:29,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:41:29,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:41:14" (3/4) ... [2024-10-11 12:41:29,046 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:41:29,049 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:41:29,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 12:41:29,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 12:41:29,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:41:29,053 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:41:29,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:41:29,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:41:29,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:41:29,144 INFO L158 Benchmark]: Toolchain (without parser) took 15137.19ms. Allocated memory was 62.9MB in the beginning and 570.4MB in the end (delta: 507.5MB). Free memory was 40.2MB in the beginning and 497.9MB in the end (delta: -457.7MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-10-11 12:41:29,144 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:41:29,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.34ms. Allocated memory is still 62.9MB. Free memory was 40.1MB in the beginning and 26.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:41:29,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.08ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 26.2MB in the beginning and 65.2MB in the end (delta: -39.0MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-10-11 12:41:29,145 INFO L158 Benchmark]: Boogie Preprocessor took 65.04ms. Allocated memory is still 86.0MB. Free memory was 65.2MB in the beginning and 62.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:41:29,146 INFO L158 Benchmark]: RCFGBuilder took 489.16ms. Allocated memory is still 86.0MB. Free memory was 62.7MB in the beginning and 47.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:41:29,146 INFO L158 Benchmark]: TraceAbstraction took 14073.17ms. Allocated memory was 86.0MB in the beginning and 570.4MB in the end (delta: 484.4MB). Free memory was 46.3MB in the beginning and 502.1MB in the end (delta: -455.7MB). Peak memory consumption was 324.7MB. Max. memory is 16.1GB. [2024-10-11 12:41:29,146 INFO L158 Benchmark]: Witness Printer took 100.14ms. Allocated memory is still 570.4MB. Free memory was 502.1MB in the beginning and 497.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:41:29,148 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.16ms. Allocated memory is still 62.9MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.34ms. Allocated memory is still 62.9MB. Free memory was 40.1MB in the beginning and 26.2MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.08ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 26.2MB in the beginning and 65.2MB in the end (delta: -39.0MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.04ms. Allocated memory is still 86.0MB. Free memory was 65.2MB in the beginning and 62.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 489.16ms. Allocated memory is still 86.0MB. Free memory was 62.7MB in the beginning and 47.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14073.17ms. Allocated memory was 86.0MB in the beginning and 570.4MB in the end (delta: 484.4MB). Free memory was 46.3MB in the beginning and 502.1MB in the end (delta: -455.7MB). Peak memory consumption was 324.7MB. Max. memory is 16.1GB. * Witness Printer took 100.14ms. Allocated memory is still 570.4MB. Free memory was 502.1MB in the beginning and 497.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 315 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 136 mSDtfsCounter, 315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=4, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 SizeOfPredicates, 21 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 200/200 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: 81]: Loop Invariant Derived loop invariant: (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (((var_1_10 == var_1_11) && (var_1_1 == var_1_3)) && (var_1_9 == 64))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (var_1_9 == 64)) Ensures: ((0 != cond) && (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (var_1_9 == 64))) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:41:29,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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