./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:58:53,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:58:54,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:58:54,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:58:54,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:58:54,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:58:54,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:58:54,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:58:54,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:58:54,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:58:54,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:58:54,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:58:54,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:58:54,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:58:54,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:58:54,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:58:54,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:58:54,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:58:54,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:58:54,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:58:54,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:58:54,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:58:54,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:58:54,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:58:54,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:58:54,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:58:54,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:58:54,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:58:54,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:58:54,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:58:54,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:58:54,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:58:54,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:58:54,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:58:54,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:58:54,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:58:54,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:58:54,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:58:54,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:58:54,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:58:54,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:58:54,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:58:54,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 [2024-11-18 23:58:54,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:58:54,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:58:54,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:58:54,342 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:58:54,342 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:58:54,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-18 23:58:55,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:58:56,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:58:56,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-18 23:58:56,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270edb62f/aafbeaff03f34e6094580436000528c0/FLAG3639a8ccb [2024-11-18 23:58:56,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/270edb62f/aafbeaff03f34e6094580436000528c0 [2024-11-18 23:58:56,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:58:56,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:58:56,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:58:56,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:58:56,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:58:56,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65870940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56, skipping insertion in model container [2024-11-18 23:58:56,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:58:56,330 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i[915,928] [2024-11-18 23:58:56,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:58:56,411 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:58:56,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i[915,928] [2024-11-18 23:58:56,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:58:56,507 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:58:56,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56 WrapperNode [2024-11-18 23:58:56,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:58:56,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:58:56,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:58:56,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:58:56,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,589 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-18 23:58:56,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:58:56,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:58:56,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:58:56,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:58:56,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,652 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 23:58:56,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:58:56,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:58:56,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:58:56,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:58:56,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (1/1) ... [2024-11-18 23:58:56,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:58:56,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:58:56,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 23:58:56,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 23:58:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:58:56,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:58:56,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:58:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:58:56,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:58:56,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:58:56,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:58:56,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:58:57,163 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 23:58:57,164 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:58:57,180 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:58:57,181 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:58:57,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:57 BoogieIcfgContainer [2024-11-18 23:58:57,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:58:57,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:58:57,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:58:57,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:58:57,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:58:56" (1/3) ... [2024-11-18 23:58:57,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ecdd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:57, skipping insertion in model container [2024-11-18 23:58:57,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:56" (2/3) ... [2024-11-18 23:58:57,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ecdd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:57, skipping insertion in model container [2024-11-18 23:58:57,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:57" (3/3) ... [2024-11-18 23:58:57,190 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-84.i [2024-11-18 23:58:57,203 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:58:57,204 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:58:57,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:58:57,259 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;@2d794666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:58:57,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:58:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 23:58:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:58:57,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:57,274 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:58:57,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:57,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1290669553, now seen corresponding path program 1 times [2024-11-18 23:58:57,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:58:57,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885923550] [2024-11-18 23:58:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:58:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:57,573 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-18 23:58:57,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:58:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885923550] [2024-11-18 23:58:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885923550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:58:57,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743038345] [2024-11-18 23:58:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:57,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:58:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:58:57,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:58:57,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 23:58:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:57,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:58:57,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:58:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-18 23:58:57,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:58:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743038345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:58:57,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:58:57,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:58:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257615913] [2024-11-18 23:58:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:58:57,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:58:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:58:57,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:58:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:58:57,787 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 23:58:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:58:57,807 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2024-11-18 23:58:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:58:57,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-18 23:58:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:58:57,815 INFO L225 Difference]: With dead ends: 81 [2024-11-18 23:58:57,815 INFO L226 Difference]: Without dead ends: 40 [2024-11-18 23:58:57,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:58:57,821 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:58:57,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:58:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-18 23:58:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-18 23:58:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 23:58:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-18 23:58:57,876 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2024-11-18 23:58:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:58:57,877 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-18 23:58:57,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 23:58:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-18 23:58:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:58:57,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:57,883 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:58:57,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 23:58:58,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:58:58,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash -311629705, now seen corresponding path program 1 times [2024-11-18 23:58:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:58:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951372845] [2024-11-18 23:58:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:58:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:58:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-18 23:58:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:58:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951372845] [2024-11-18 23:58:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951372845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:58:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:58:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:58:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699859805] [2024-11-18 23:58:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:58:58,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:58:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:58:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:58:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:58:58,282 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-18 23:58:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:58:58,313 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-18 23:58:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:58:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2024-11-18 23:58:58,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:58:58,317 INFO L225 Difference]: With dead ends: 77 [2024-11-18 23:58:58,318 INFO L226 Difference]: Without dead ends: 40 [2024-11-18 23:58:58,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 23:58:58,320 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:58:58,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:58:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-18 23:58:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-18 23:58:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 23:58:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-18 23:58:58,330 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2024-11-18 23:58:58,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:58:58,332 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-18 23:58:58,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-18 23:58:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-18 23:58:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:58:58,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:58:58,335 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:58:58,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:58:58,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:58:58,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:58:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1463377657, now seen corresponding path program 1 times [2024-11-18 23:58:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:58:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478567612] [2024-11-18 23:58:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:58:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:58:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:58:58,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:58:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:58:58,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:58:58,635 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:58:58,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:58:58,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:58:58,641 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-18 23:58:58,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:58:58,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:58:58 BoogieIcfgContainer [2024-11-18 23:58:58,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:58:58,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:58:58,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:58:58,707 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:58:58,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:57" (3/4) ... [2024-11-18 23:58:58,711 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:58:58,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:58:58,716 INFO L158 Benchmark]: Toolchain (without parser) took 2598.68ms. Allocated memory is still 161.5MB. Free memory was 95.8MB in the beginning and 115.5MB in the end (delta: -19.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:58:58,717 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:58:58,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.62ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 135.1MB in the end (delta: -39.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-18 23:58:58,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.07ms. Allocated memory is still 161.5MB. Free memory was 135.1MB in the beginning and 131.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 23:58:58,721 INFO L158 Benchmark]: Boogie Preprocessor took 83.25ms. Allocated memory is still 161.5MB. Free memory was 131.3MB in the beginning and 125.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 23:58:58,722 INFO L158 Benchmark]: RCFGBuilder took 506.91ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 107.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 23:58:58,722 INFO L158 Benchmark]: TraceAbstraction took 1523.80ms. Allocated memory is still 161.5MB. Free memory was 106.8MB in the beginning and 116.5MB in the end (delta: -9.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:58:58,722 INFO L158 Benchmark]: Witness Printer took 8.23ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.5MB in the end (delta: 952.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:58:58,724 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.18ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.62ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 135.1MB in the end (delta: -39.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.07ms. Allocated memory is still 161.5MB. Free memory was 135.1MB in the beginning and 131.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.25ms. Allocated memory is still 161.5MB. Free memory was 131.3MB in the beginning and 125.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 506.91ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 107.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1523.80ms. Allocated memory is still 161.5MB. Free memory was 106.8MB in the beginning and 116.5MB in the end (delta: -9.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 8.23ms. Allocated memory is still 161.5MB. Free memory was 116.5MB in the beginning and 115.5MB in the end (delta: 952.7kB). Peak memory consumption was 2.1MB. 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 someBinaryFLOATComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned char var_1_4 = 25; [L24] unsigned char var_1_5 = 64; [L25] unsigned char var_1_6 = 8; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 10; [L28] float var_1_9 = 9.6; [L29] float var_1_10 = 99.08; [L30] float var_1_11 = 63.4; [L31] float var_1_12 = 32.125; [L32] signed long int var_1_13 = -8; [L33] signed short int var_1_14 = -2; VAL [isInitial=0, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=25, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L73] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L73] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L77] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L78] var_1_12 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L92] RET updateVariables() [L93] CALL step() [L37] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, stepLocal_1=8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L38] COND TRUE var_1_5 > stepLocal_1 [L39] var_1_8 = (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L41] var_1_13 = var_1_7 [L42] var_1_14 = var_1_7 [L43] signed short int stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=9, var_1_13=9, var_1_14=9, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L44] COND FALSE !(var_1_14 != stepLocal_0) [L47] var_1_1 = ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L49] signed long int stepLocal_3 = var_1_13; [L50] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L51] COND FALSE !((var_1_10 * var_1_11) > 16.75f) VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L93] RET step() [L94] CALL, EXPR property() [L84-L85] return (((((var_1_14 != var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + ((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)))))) : (var_1_1 == ((unsigned char) ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7)))))) && ((var_1_5 > var_1_4) ? (var_1_8 == ((unsigned char) (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))))) : 1)) && (((var_1_10 * var_1_11) > 16.75f) ? ((var_1_7 <= var_1_1) ? ((-8 > var_1_13) ? (var_1_9 == ((float) var_1_12)) : 1) : (var_1_9 == ((float) var_1_12))) : 1)) && (var_1_13 == ((signed long int) var_1_7))) && (var_1_14 == ((signed short int) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L19] reach_error() VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 108 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 640/660 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-11-18 23:58:58,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:59:00,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:59:01,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:59:01,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:59:01,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:59:01,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:59:01,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:59:01,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:59:01,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:59:01,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:59:01,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:59:01,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:59:01,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:59:01,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:59:01,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:59:01,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:59:01,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:59:01,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:59:01,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:59:01,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:59:01,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:59:01,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:59:01,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:59:01,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:59:01,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:59:01,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:59:01,103 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:59:01,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:59:01,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:59:01,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:59:01,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:59:01,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:59:01,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:59:01,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:59:01,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:59:01,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:59:01,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:59:01,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:59:01,113 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:59:01,113 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:59:01,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:59:01,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:59:01,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:59:01,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:59:01,114 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 [2024-11-18 23:59:01,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:59:01,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:59:01,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:59:01,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:59:01,494 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:59:01,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-18 23:59:03,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:59:03,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:59:03,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-18 23:59:03,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0c3831d/ae22ddedd5a14df59f0dd335e55a16c2/FLAG90f97a082 [2024-11-18 23:59:03,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0c3831d/ae22ddedd5a14df59f0dd335e55a16c2 [2024-11-18 23:59:03,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:59:03,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:59:03,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:59:03,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:59:03,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:59:03,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102237ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03, skipping insertion in model container [2024-11-18 23:59:03,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:59:03,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i[915,928] [2024-11-18 23:59:03,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:59:03,594 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:59:03,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i[915,928] [2024-11-18 23:59:03,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:59:03,663 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:59:03,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03 WrapperNode [2024-11-18 23:59:03,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:59:03,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:59:03,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:59:03,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:59:03,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,720 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-18 23:59:03,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:59:03,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:59:03,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:59:03,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:59:03,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,736 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,758 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 23:59:03,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:59:03,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:59:03,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:59:03,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:59:03,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (1/1) ... [2024-11-18 23:59:03,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:59:03,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:59:03,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 23:59:03,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 23:59:03,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:59:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:59:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:59:03,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:59:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:59:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:59:03,983 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:59:03,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:59:04,714 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 23:59:04,714 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:59:04,727 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:59:04,728 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:59:04,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:04 BoogieIcfgContainer [2024-11-18 23:59:04,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:59:04,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:59:04,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:59:04,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:59:04,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:59:03" (1/3) ... [2024-11-18 23:59:04,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ca293a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:59:04, skipping insertion in model container [2024-11-18 23:59:04,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:59:03" (2/3) ... [2024-11-18 23:59:04,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ca293a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:59:04, skipping insertion in model container [2024-11-18 23:59:04,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:59:04" (3/3) ... [2024-11-18 23:59:04,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-84.i [2024-11-18 23:59:04,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:59:04,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:59:04,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:59:04,811 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;@54e16bee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:59:04,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:59:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 23:59:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:59:04,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:04,829 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:59:04,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:04,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1290669553, now seen corresponding path program 1 times [2024-11-18 23:59:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:59:04,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829367270] [2024-11-18 23:59:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:04,848 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-11-18 23:59:04,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:59:04,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-18 23:59:04,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-18 23:59:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:05,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:59:05,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:59:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-18 23:59:05,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:59:05,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:59:05,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829367270] [2024-11-18 23:59:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829367270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:59:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602092290] [2024-11-18 23:59:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:59:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:59:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:59:05,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:59:05,187 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 23:59:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:05,213 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2024-11-18 23:59:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:59:05,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-18 23:59:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:05,221 INFO L225 Difference]: With dead ends: 81 [2024-11-18 23:59:05,221 INFO L226 Difference]: Without dead ends: 40 [2024-11-18 23:59:05,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:59:05,227 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:05,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:59:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-18 23:59:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-18 23:59:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 23:59:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-18 23:59:05,263 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2024-11-18 23:59:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:05,264 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-18 23:59:05,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-18 23:59:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-18 23:59:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:59:05,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:05,268 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:59:05,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-18 23:59:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-18 23:59:05,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:05,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash -311629705, now seen corresponding path program 1 times [2024-11-18 23:59:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:59:05,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439078336] [2024-11-18 23:59:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:05,471 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-11-18 23:59:05,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:59:05,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-18 23:59:05,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-18 23:59:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:05,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 23:59:05,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:59:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-18 23:59:05,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:59:05,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:59:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439078336] [2024-11-18 23:59:05,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439078336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:59:05,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:59:05,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:59:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935110871] [2024-11-18 23:59:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:59:05,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:59:05,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:59:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:59:05,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:59:05,740 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-18 23:59:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:59:05,863 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-18 23:59:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:59:05,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2024-11-18 23:59:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:59:05,876 INFO L225 Difference]: With dead ends: 77 [2024-11-18 23:59:05,876 INFO L226 Difference]: Without dead ends: 40 [2024-11-18 23:59:05,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-11-18 23:59:05,878 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:59:05,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:59:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-18 23:59:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-18 23:59:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-18 23:59:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-18 23:59:05,886 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2024-11-18 23:59:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:59:05,888 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-18 23:59:05,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-18 23:59:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-18 23:59:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 23:59:05,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:59:05,891 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:59:05,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-18 23:59:06,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-18 23:59:06,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:59:06,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:59:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1463377657, now seen corresponding path program 1 times [2024-11-18 23:59:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:59:06,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941310457] [2024-11-18 23:59:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:59:06,095 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-11-18 23:59:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:59:06,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-18 23:59:06,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-18 23:59:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:59:06,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 23:59:06,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:00:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:00:20,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:00:20,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:00:20,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941310457] [2024-11-19 00:00:20,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941310457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:00:20,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:00:20,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:00:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108817179] [2024-11-19 00:00:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:00:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:00:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:00:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:00:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:00:20,431 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)