./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.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_amount10_file-62.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 edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:37:54,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:37:54,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:37:54,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:37:54,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:37:54,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:37:54,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:37:54,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:37:54,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:37:54,787 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:37:54,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:37:54,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:37:54,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:37:54,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:37:54,788 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:37:54,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:37:54,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:37:54,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:37:54,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:37:54,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:37:54,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:37:54,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:37:54,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:37:54,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:37:54,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:37:54,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:37:54,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:37:54,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:37:54,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:37:54,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:37:54,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:37:54,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:37:54,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:37:54,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:37:54,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:37:54,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:37:54,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:37:54,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:37:54,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:37:54,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:37:54,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:37:54,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:37:54,797 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 -> edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda [2024-11-18 23:37:55,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:37:55,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:37:55,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:37:55,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:37:55,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:37:55,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2024-11-18 23:37:56,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:37:56,681 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:37:56,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2024-11-18 23:37:56,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9bdff361/bb71ec4aa27848b4bb4f4e5797b4fd2a/FLAG6eb356f7e [2024-11-18 23:37:56,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9bdff361/bb71ec4aa27848b4bb4f4e5797b4fd2a [2024-11-18 23:37:56,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:37:56,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:37:56,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:37:56,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:37:56,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:37:56,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:56" (1/1) ... [2024-11-18 23:37:56,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234a4219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:56, skipping insertion in model container [2024-11-18 23:37:56,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:37:56" (1/1) ... [2024-11-18 23:37:56,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:37:56,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i[915,928] [2024-11-18 23:37:56,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:37:56,977 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:37:57,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i[915,928] [2024-11-18 23:37:57,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:37:57,051 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:37:57,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57 WrapperNode [2024-11-18 23:37:57,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:37:57,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:37:57,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:37:57,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:37:57,100 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:37:57" (1/1) ... [2024-11-18 23:37:57,113 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:37:57" (1/1) ... [2024-11-18 23:37:57,141 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2024-11-18 23:37:57,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:37:57,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:37:57,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:37:57,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:37:57,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,170 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:37:57,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:37:57,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:37:57,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:37:57,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:37:57,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (1/1) ... [2024-11-18 23:37:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:37:57,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:37:57,227 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:37:57,232 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:37:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:37:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:37:57,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:37:57,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:37:57,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:37:57,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:37:57,333 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:37:57,335 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:37:57,478 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 23:37:57,479 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:37:57,492 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:37:57,493 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:37:57,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:57 BoogieIcfgContainer [2024-11-18 23:37:57,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:37:57,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:37:57,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:37:57,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:37:57,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:37:56" (1/3) ... [2024-11-18 23:37:57,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5238e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:37:57, skipping insertion in model container [2024-11-18 23:37:57,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:37:57" (2/3) ... [2024-11-18 23:37:57,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5238e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:37:57, skipping insertion in model container [2024-11-18 23:37:57,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:57" (3/3) ... [2024-11-18 23:37:57,502 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2024-11-18 23:37:57,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:37:57,518 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:37:57,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:37:57,579 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;@2ada7c32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:37:57,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:37:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 23:37:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 23:37:57,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:37:57,592 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:37:57,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:37:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:37:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1896657020, now seen corresponding path program 1 times [2024-11-18 23:37:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:37:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326069104] [2024-11-18 23:37:57,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:37:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:37:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:37:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-18 23:37:57,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:37:57,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326069104] [2024-11-18 23:37:57,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326069104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:37:57,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025191964] [2024-11-18 23:37:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:37:57,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:37:57,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:37:57,886 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:37:57,887 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:37:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:37:58,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:37:58,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:37:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-18 23:37:58,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:37:58,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025191964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:37:58,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:37:58,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:37:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678747535] [2024-11-18 23:37:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:37:58,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:37:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:37:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:37:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:37:58,093 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 23:37:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:37:58,120 INFO L93 Difference]: Finished difference Result 73 states and 114 transitions. [2024-11-18 23:37:58,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:37:58,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-18 23:37:58,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:37:58,130 INFO L225 Difference]: With dead ends: 73 [2024-11-18 23:37:58,130 INFO L226 Difference]: Without dead ends: 36 [2024-11-18 23:37:58,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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:37:58,139 INFO L432 NwaCegarLoop]: 48 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, 48 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:37:58,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:37:58,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-18 23:37:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-18 23:37:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 23:37:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-18 23:37:58,181 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 69 [2024-11-18 23:37:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:37:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-18 23:37:58,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 23:37:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-18 23:37:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 23:37:58,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:37:58,184 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:37:58,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 23:37:58,389 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:37:58,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:37:58,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:37:58,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1688895292, now seen corresponding path program 1 times [2024-11-18 23:37:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:37:58,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768356782] [2024-11-18 23:37:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:37:58,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:37:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:37:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-18 23:37:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:37:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768356782] [2024-11-18 23:37:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768356782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:37:58,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:37:58,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:37:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997597282] [2024-11-18 23:37:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:37:58,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:37:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:37:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:37:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:37:58,810 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-18 23:37:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:37:58,872 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2024-11-18 23:37:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:37:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-18 23:37:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:37:58,876 INFO L225 Difference]: With dead ends: 80 [2024-11-18 23:37:58,876 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 23:37:58,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:37:58,879 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:37:58,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:37:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 23:37:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2024-11-18 23:37:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 23:37:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-18 23:37:58,889 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 69 [2024-11-18 23:37:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:37:58,892 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-18 23:37:58,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-18 23:37:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-18 23:37:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 23:37:58,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:37:58,898 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:37:58,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:37:58,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:37:58,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:37:58,899 INFO L85 PathProgramCache]: Analyzing trace with hash 86112070, now seen corresponding path program 1 times [2024-11-18 23:37:58,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:37:58,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899469911] [2024-11-18 23:37:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:37:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:37:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:37:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-18 23:37:59,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:37:59,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899469911] [2024-11-18 23:37:59,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899469911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:37:59,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:37:59,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 23:37:59,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77489572] [2024-11-18 23:37:59,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:37:59,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 23:37:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:37:59,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 23:37:59,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 23:37:59,281 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-18 23:37:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:37:59,361 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-18 23:37:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 23:37:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-18 23:37:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:37:59,363 INFO L225 Difference]: With dead ends: 55 [2024-11-18 23:37:59,364 INFO L226 Difference]: Without dead ends: 53 [2024-11-18 23:37:59,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:37:59,365 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:37:59,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 201 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:37:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-18 23:37:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2024-11-18 23:37:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 23:37:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-18 23:37:59,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 69 [2024-11-18 23:37:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:37:59,374 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-18 23:37:59,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-18 23:37:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-18 23:37:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-18 23:37:59,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:37:59,376 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:37:59,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:37:59,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:37:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:37:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1049859780, now seen corresponding path program 1 times [2024-11-18 23:37:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:37:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728212172] [2024-11-18 23:37:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:37:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:37:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:37:59,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 23:37:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 23:37:59,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 23:37:59,477 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 23:37:59,478 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 23:37:59,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 23:37:59,485 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-18 23:37:59,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 23:37:59,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:37:59 BoogieIcfgContainer [2024-11-18 23:37:59,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 23:37:59,556 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 23:37:59,556 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 23:37:59,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 23:37:59,557 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:37:57" (3/4) ... [2024-11-18 23:37:59,560 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 23:37:59,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 23:37:59,561 INFO L158 Benchmark]: Toolchain (without parser) took 2854.46ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 75.3MB in the end (delta: 24.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 23:37:59,561 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:37:59,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.63ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 139.0MB in the end (delta: -39.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-18 23:37:59,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.44ms. Allocated memory is still 167.8MB. Free memory was 139.0MB in the beginning and 136.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 23:37:59,566 INFO L158 Benchmark]: Boogie Preprocessor took 44.25ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 134.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:37:59,566 INFO L158 Benchmark]: RCFGBuilder took 306.21ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 122.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 23:37:59,566 INFO L158 Benchmark]: TraceAbstraction took 2059.83ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 76.4MB in the end (delta: 45.2MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2024-11-18 23:37:59,567 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 75.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 23:37:59,568 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.19ms. Allocated memory is still 109.1MB. Free memory is still 69.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.63ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 139.0MB in the end (delta: -39.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.44ms. Allocated memory is still 167.8MB. Free memory was 139.0MB in the beginning and 136.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.25ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 134.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.21ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 122.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2059.83ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 76.4MB in the end (delta: 45.2MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 167.8MB. Free memory was 76.4MB in the beginning and 75.3MB in the end (delta: 1.1MB). 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 someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryArithmeticDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 31.95; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 255.6; [L25] double var_1_4 = 50.8; [L26] double var_1_5 = 4.4; [L27] double var_1_6 = 100.8; [L28] unsigned char var_1_7 = 50; [L29] signed long int var_1_8 = 256; [L30] unsigned char var_1_9 = 25; VAL [isInitial=0, var_1_1=639/20, var_1_2=0, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L70] isInitial = 1 [L71] FCALL initially() [L72] COND TRUE 1 [L73] FCALL updateLastVariables() [L74] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=639/20, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_3=1278/5, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L48] var_1_3 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L49] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_4=254/5, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L50] var_1_4 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L51] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_5=22/5, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L52] var_1_5 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L53] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_6=504/5, var_1_7=50, var_1_8=256, var_1_9=25] [L54] var_1_6 = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=256, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=256, var_1_9=25] [L55] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=256, var_1_9=25] [L56] var_1_8 = __VERIFIER_nondet_long() [L57] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L57] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L58] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L58] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=25] [L59] var_1_9 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0] [L60] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0] [L61] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L61] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_1=639/20, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L74] RET updateVariables() [L75] CALL step() [L34] COND TRUE \read(var_1_2) [L35] var_1_1 = (var_1_3 + ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))) VAL [isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L37] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-255, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L38] COND TRUE (-10 != var_1_8) || stepLocal_0 VAL [isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L39] COND FALSE !(var_1_1 >= 500.5) VAL [isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L75] RET step() [L76] CALL, EXPR property() [L66-L67] return (var_1_2 ? (var_1_1 == ((double) (var_1_3 + ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6)))))) : 1) && (((-10 != var_1_8) || var_1_2) ? ((var_1_1 >= 500.5) ? (var_1_7 == ((unsigned char) var_1_9)) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L76] RET, EXPR property() [L76] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_2=-255, var_1_7=50, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 153 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 702/720 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:37:59,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_amount10_file-62.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 edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:38:01,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:38:01,876 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 23:38:01,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:38:01,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:38:01,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:38:01,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:38:01,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:38:01,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:38:01,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:38:01,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:38:01,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:38:01,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:38:01,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:38:01,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:38:01,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:38:01,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:38:01,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:38:01,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:38:01,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:38:01,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:38:01,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:38:01,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:38:01,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 23:38:01,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 23:38:01,923 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:38:01,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 23:38:01,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:38:01,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:38:01,924 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:38:01,924 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:38:01,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:38:01,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:38:01,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:38:01,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:38:01,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:38:01,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:38:01,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:38:01,927 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 23:38:01,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 23:38:01,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:38:01,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:38:01,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:38:01,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:38:01,929 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 -> edd572089f4885b6ba1c299f33956a42c4a7e2e6ff831c60c0b6124e5750ebda [2024-11-18 23:38:02,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:38:02,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:38:02,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:38:02,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:38:02,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:38:02,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2024-11-18 23:38:03,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:38:04,026 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:38:04,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2024-11-18 23:38:04,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31d8be68/9c6a5a55e8ac4bb0998dcd46666d3f72/FLAGf0fd0652e [2024-11-18 23:38:04,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31d8be68/9c6a5a55e8ac4bb0998dcd46666d3f72 [2024-11-18 23:38:04,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:38:04,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:38:04,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:38:04,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:38:04,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:38:04,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be8f928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04, skipping insertion in model container [2024-11-18 23:38:04,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:38:04,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i[915,928] [2024-11-18 23:38:04,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:38:04,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:38:04,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i[915,928] [2024-11-18 23:38:04,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:38:04,378 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:38:04,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04 WrapperNode [2024-11-18 23:38:04,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:38:04,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:38:04,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:38:04,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:38:04,386 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:38:04" (1/1) ... [2024-11-18 23:38:04,396 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:38:04" (1/1) ... [2024-11-18 23:38:04,421 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2024-11-18 23:38:04,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:38:04,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:38:04,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:38:04,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:38:04,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,445 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:38:04,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:38:04,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:38:04,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:38:04,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:38:04,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (1/1) ... [2024-11-18 23:38:04,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:38:04,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:38:04,505 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:38:04,512 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:38:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:38:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 23:38:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:38:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:38:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:38:04,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:38:04,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:38:04,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:38:05,102 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 23:38:05,105 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:38:05,119 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:38:05,119 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:38:05,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:38:05 BoogieIcfgContainer [2024-11-18 23:38:05,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:38:05,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:38:05,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:38:05,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:38:05,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:38:04" (1/3) ... [2024-11-18 23:38:05,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acaefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:38:05, skipping insertion in model container [2024-11-18 23:38:05,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:38:04" (2/3) ... [2024-11-18 23:38:05,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acaefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:38:05, skipping insertion in model container [2024-11-18 23:38:05,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:38:05" (3/3) ... [2024-11-18 23:38:05,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2024-11-18 23:38:05,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:38:05,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:38:05,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:38:05,226 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;@4a151a9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:38:05,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:38:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 23:38:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 23:38:05,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:05,241 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:38:05,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1896657020, now seen corresponding path program 1 times [2024-11-18 23:38:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:38:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898341010] [2024-11-18 23:38:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:05,264 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:38:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:38:05,268 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:38:05,269 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:38:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:05,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:38:05,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:38:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-18 23:38:05,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:38:05,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:38:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898341010] [2024-11-18 23:38:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898341010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:38:05,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:38:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 23:38:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122256541] [2024-11-18 23:38:05,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:38:05,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:38:05,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:38:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:38:05,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:38:05,612 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 23:38:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:38:05,639 INFO L93 Difference]: Finished difference Result 73 states and 114 transitions. [2024-11-18 23:38:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:38:05,642 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-18 23:38:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:38:05,649 INFO L225 Difference]: With dead ends: 73 [2024-11-18 23:38:05,650 INFO L226 Difference]: Without dead ends: 36 [2024-11-18 23:38:05,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:38:05,660 INFO L432 NwaCegarLoop]: 48 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, 48 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:38:05,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:38:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-18 23:38:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-18 23:38:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 23:38:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-18 23:38:05,705 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 69 [2024-11-18 23:38:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:38:05,706 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-18 23:38:05,707 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, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-18 23:38:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-18 23:38:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 23:38:05,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:05,713 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:38:05,724 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-18 23:38:05,918 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:38:05,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:05,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1688895292, now seen corresponding path program 1 times [2024-11-18 23:38:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:38:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118217819] [2024-11-18 23:38:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:05,922 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:38:05,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:38:05,925 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:38:05,927 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:38:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:06,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 23:38:06,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:38:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-18 23:38:06,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:38:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-18 23:38:06,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 23:38:06,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118217819] [2024-11-18 23:38:06,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118217819] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 23:38:06,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:38:06,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-18 23:38:06,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539813677] [2024-11-18 23:38:06,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:38:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:38:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 23:38:06,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:38:06,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:38:06,542 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-18 23:38:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:38:06,819 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2024-11-18 23:38:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:38:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-18 23:38:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:38:06,821 INFO L225 Difference]: With dead ends: 80 [2024-11-18 23:38:06,821 INFO L226 Difference]: Without dead ends: 47 [2024-11-18 23:38:06,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-18 23:38:06,823 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:38:06,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 143 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:38:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-18 23:38:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2024-11-18 23:38:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 23:38:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-18 23:38:06,831 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 69 [2024-11-18 23:38:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:38:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-18 23:38:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-18 23:38:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-18 23:38:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 23:38:06,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:38:06,834 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:38:06,841 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:38:07,037 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:38:07,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:38:07,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:38:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash 86112070, now seen corresponding path program 1 times [2024-11-18 23:38:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 23:38:07,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10915946] [2024-11-18 23:38:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:38:07,040 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:38:07,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 23:38:07,043 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:38:07,044 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:38:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:38:07,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 23:38:07,185 INFO L278 TraceCheckSpWp]: Computing forward predicates...