./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 023d838f 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.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:18:13,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:18:13,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:18:13,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:18:13,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:18:13,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:18:13,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:18:13,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:18:13,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:18:13,646 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:18:13,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:18:13,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:18:13,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:18:13,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:18:13,647 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:18:13,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:18:13,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:18:13,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:18:13,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:18:13,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:18:13,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:18:13,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:18:13,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:18:13,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:18:13,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:18:13,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:18:13,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:18:13,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:18:13,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:18:13,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:18:13,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:18:13,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:18:13,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:18:13,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:18:13,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:18:13,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:18:13,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:18:13,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:18:13,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:18:13,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:18:13,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:18:13,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:18:13,654 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-10 08:18:13,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:18:13,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:18:13,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:18:13,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:18:13,932 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:18:13,934 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-10 08:18:15,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:18:15,482 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:18:15,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2024-11-10 08:18:15,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e572a89/399bd084aa0d437eb85cea02529cd9f0/FLAG05764e6f9 [2024-11-10 08:18:15,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3e572a89/399bd084aa0d437eb85cea02529cd9f0 [2024-11-10 08:18:15,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:18:15,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:18:15,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:18:15,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:18:15,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:18:15,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5588e0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15, skipping insertion in model container [2024-11-10 08:18:15,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:18:15,756 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-10 08:18:15,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:18:15,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:18:15,822 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-10 08:18:15,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:18:15,848 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:18:15,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15 WrapperNode [2024-11-10 08:18:15,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:18:15,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:18:15,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:18:15,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:18:15,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,891 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2024-11-10 08:18:15,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:18:15,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:18:15,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:18:15,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:18:15,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,914 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-10 08:18:15,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:18:15,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:18:15,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:18:15,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:18:15,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (1/1) ... [2024-11-10 08:18:15,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:18:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:18:15,956 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-10 08:18:15,959 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-10 08:18:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:18:15,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:18:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:18:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:18:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:18:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:18:16,052 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:18:16,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:18:16,235 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:18:16,236 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:18:16,249 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:18:16,250 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:18:16,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:16 BoogieIcfgContainer [2024-11-10 08:18:16,251 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:18:16,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:18:16,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:18:16,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:18:16,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:18:15" (1/3) ... [2024-11-10 08:18:16,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15464975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:18:16, skipping insertion in model container [2024-11-10 08:18:16,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:15" (2/3) ... [2024-11-10 08:18:16,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15464975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:18:16, skipping insertion in model container [2024-11-10 08:18:16,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:16" (3/3) ... [2024-11-10 08:18:16,260 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2024-11-10 08:18:16,276 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:18:16,277 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:18:16,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:18:16,334 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;@5533e2a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:18:16,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:18:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-10 08:18:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:18:16,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:16,348 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, 1] [2024-11-10 08:18:16,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:16,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1326740206, now seen corresponding path program 1 times [2024-11-10 08:18:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:18:16,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846470740] [2024-11-10 08:18:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:18:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:18:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:18:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:18:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:18:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:18:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 08:18:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 08:18:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:18:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:18:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:18:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:16,651 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-10 08:18:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:18:16,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846470740] [2024-11-10 08:18:16,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846470740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:18:16,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:18:16,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:18:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020827017] [2024-11-10 08:18:16,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:16,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:18:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:18:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:18:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:18:16,684 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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), 1 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-10 08:18:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:16,705 INFO L93 Difference]: Finished difference Result 78 states and 119 transitions. [2024-11-10 08:18:16,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:18:16,708 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), 1 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 71 [2024-11-10 08:18:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:16,713 INFO L225 Difference]: With dead ends: 78 [2024-11-10 08:18:16,713 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 08:18:16,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-10 08:18:16,718 INFO L432 NwaCegarLoop]: 50 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, 50 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-10 08:18:16,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:18:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 08:18:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 08:18:16,752 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-10 08:18:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-10 08:18:16,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 71 [2024-11-10 08:18:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:16,755 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-10 08:18:16,756 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), 1 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-10 08:18:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-10 08:18:16,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:18:16,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:16,759 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, 1] [2024-11-10 08:18:16,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:18:16,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:16,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash -562229430, now seen corresponding path program 1 times [2024-11-10 08:18:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:18:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687106526] [2024-11-10 08:18:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:18:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:18:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:18:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:18:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:18:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:18:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 08:18:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 08:18:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:18:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:18:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:18:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,162 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-10 08:18:17,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:18:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687106526] [2024-11-10 08:18:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687106526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:18:17,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:18:17,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:18:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750865649] [2024-11-10 08:18:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:17,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:18:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:18:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:18:17,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:18:17,166 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10 08:18:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:17,203 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-11-10 08:18:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:18:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 71 [2024-11-10 08:18:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:17,205 INFO L225 Difference]: With dead ends: 86 [2024-11-10 08:18:17,206 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 08:18:17,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-10 08:18:17,207 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 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-10 08:18:17,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:18:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 08:18:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-11-10 08:18:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-10 08:18:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-10 08:18:17,218 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 71 [2024-11-10 08:18:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:17,220 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-10 08:18:17,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10 08:18:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-10 08:18:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:18:17,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:17,221 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, 1] [2024-11-10 08:18:17,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:18:17,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:17,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1180580905, now seen corresponding path program 1 times [2024-11-10 08:18:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:18:17,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743492897] [2024-11-10 08:18:17,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:17,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:18:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:18:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:18:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:18:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:18:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:18:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 08:18:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 08:18:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:18:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:18:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:18:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:17,492 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-10 08:18:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:18:17,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743492897] [2024-11-10 08:18:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743492897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:18:17,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:18:17,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:18:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260412847] [2024-11-10 08:18:17,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:18:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:18:17,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:18:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:18:17,495 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-10 08:18:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:17,550 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-11-10 08:18:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 08:18:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 71 [2024-11-10 08:18:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:17,552 INFO L225 Difference]: With dead ends: 61 [2024-11-10 08:18:17,552 INFO L226 Difference]: Without dead ends: 58 [2024-11-10 08:18:17,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:18:17,557 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 217 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-10 08:18:17,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 217 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:18:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-10 08:18:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2024-11-10 08:18:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 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-10 08:18:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-10 08:18:17,567 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 71 [2024-11-10 08:18:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:17,568 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-10 08:18:17,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-10 08:18:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-10 08:18:17,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 08:18:17,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:17,570 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, 1, 1] [2024-11-10 08:18:17,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:18:17,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:17,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1106210053, now seen corresponding path program 1 times [2024-11-10 08:18:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:18:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336952960] [2024-11-10 08:18:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:18:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:18:17,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:18:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:18:17,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:18:17,681 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:18:17,682 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:18:17,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:18:17,686 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 08:18:17,734 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:18:17,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:18:17 BoogieIcfgContainer [2024-11-10 08:18:17,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:18:17,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:18:17,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:18:17,739 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:18:17,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:16" (3/4) ... [2024-11-10 08:18:17,743 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:18:17,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:18:17,745 INFO L158 Benchmark]: Toolchain (without parser) took 2238.53ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 127.2MB in the beginning and 154.5MB in the end (delta: -27.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 08:18:17,745 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory was 87.6MB in the beginning and 87.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:18:17,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.18ms. Allocated memory is still 163.6MB. Free memory was 127.2MB in the beginning and 113.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:18:17,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.07ms. Allocated memory is still 163.6MB. Free memory was 113.5MB in the beginning and 112.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:18:17,746 INFO L158 Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 163.6MB. Free memory was 112.5MB in the beginning and 110.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:18:17,747 INFO L158 Benchmark]: IcfgBuilder took 325.37ms. Allocated memory is still 163.6MB. Free memory was 110.4MB in the beginning and 96.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:18:17,747 INFO L158 Benchmark]: TraceAbstraction took 1484.64ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 95.8MB in the beginning and 154.5MB in the end (delta: -58.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:18:17,747 INFO L158 Benchmark]: Witness Printer took 6.23ms. Allocated memory is still 205.5MB. Free memory was 154.5MB in the beginning and 154.5MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:18:17,749 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.12ms. Allocated memory is still 125.8MB. Free memory was 87.6MB in the beginning and 87.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.18ms. Allocated memory is still 163.6MB. Free memory was 127.2MB in the beginning and 113.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.07ms. Allocated memory is still 163.6MB. Free memory was 113.5MB in the beginning and 112.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.01ms. Allocated memory is still 163.6MB. Free memory was 112.5MB in the beginning and 110.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 325.37ms. Allocated memory is still 163.6MB. Free memory was 110.4MB in the beginning and 96.8MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1484.64ms. Allocated memory was 163.6MB in the beginning and 205.5MB in the end (delta: 41.9MB). Free memory was 95.8MB in the beginning and 154.5MB in the end (delta: -58.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.23ms. Allocated memory is still 205.5MB. Free memory was 154.5MB in the beginning and 154.5MB in the end (delta: 2.0kB). 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=-2] [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=-2] [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=-2] [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=-2] [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=-2] [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=-2] [L39] COND TRUE var_1_1 >= 500.5 [L40] var_1_7 = var_1_9 VAL [isInitial=1, var_1_2=-255, var_1_7=-2, var_1_8=0, var_1_9=-2] [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=-2, var_1_8=0, var_1_9=-2] [L76] RET, EXPR property() [L76] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_2=-255, var_1_7=-2, var_1_8=0, var_1_9=-2] [L19] reach_error() VAL [isInitial=1, var_1_2=-255, var_1_7=-2, var_1_8=0, var_1_9=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 252 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 163 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, 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, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 540/540 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-10 08:18:17,775 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.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:18:19,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:18:19,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:18:19,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:18:19,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:18:19,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:18:19,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:18:19,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:18:19,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:18:19,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:18:19,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:18:19,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:18:19,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:18:19,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:18:19,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:18:19,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:18:19,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:18:19,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:18:19,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:18:19,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:18:19,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:18:19,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:18:19,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:18:19,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:18:19,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:18:19,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:18:19,816 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:18:19,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:18:19,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:18:19,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:18:19,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:18:19,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:18:19,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:18:19,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:18:19,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:18:19,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:18:19,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:18:19,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:18:19,818 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:18:19,818 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:18:19,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:18:19,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:18:19,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:18:19,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:18:19,821 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-10 08:18:20,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:18:20,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:18:20,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:18:20,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:18:20,131 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:18:20,132 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-10 08:18:21,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:18:21,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:18:21,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-62.i [2024-11-10 08:18:21,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec00d269d/1dbd29048b874b3a890a324d20f838e0/FLAGa8279cc0a [2024-11-10 08:18:21,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec00d269d/1dbd29048b874b3a890a324d20f838e0 [2024-11-10 08:18:21,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:18:21,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:18:21,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:18:21,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:18:21,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:18:21,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:18:21" (1/1) ... [2024-11-10 08:18:21,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6591af91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:21, skipping insertion in model container [2024-11-10 08:18:21,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:18:21" (1/1) ... [2024-11-10 08:18:21,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:18:21,939 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-10 08:18:21,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:18:21,992 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:18:22,002 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-10 08:18:22,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:18:22,039 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:18:22,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22 WrapperNode [2024-11-10 08:18:22,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:18:22,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:18:22,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:18:22,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:18:22,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,077 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-11-10 08:18:22,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:18:22,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:18:22,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:18:22,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:18:22,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,107 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-10 08:18:22,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:18:22,134 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:18:22,134 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:18:22,134 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:18:22,135 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (1/1) ... [2024-11-10 08:18:22,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:18:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:18:22,163 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-10 08:18:22,169 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-10 08:18:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:18:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:18:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:18:22,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:18:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:18:22,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:18:22,267 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:18:22,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:18:22,798 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 08:18:22,799 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:18:22,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:18:22,821 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:18:22,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:22 BoogieIcfgContainer [2024-11-10 08:18:22,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:18:22,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:18:22,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:18:22,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:18:22,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:18:21" (1/3) ... [2024-11-10 08:18:22,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b67a0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:18:22, skipping insertion in model container [2024-11-10 08:18:22,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:18:22" (2/3) ... [2024-11-10 08:18:22,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b67a0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:18:22, skipping insertion in model container [2024-11-10 08:18:22,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:18:22" (3/3) ... [2024-11-10 08:18:22,830 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-62.i [2024-11-10 08:18:22,842 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:18:22,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:18:22,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:18:22,911 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;@11119ebe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:18:22,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:18:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-10 08:18:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:18:22,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:22,926 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, 1] [2024-11-10 08:18:22,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1326740206, now seen corresponding path program 1 times [2024-11-10 08:18:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:18:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612323532] [2024-11-10 08:18:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:22,950 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-10 08:18:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:18:22,977 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-10 08:18:22,979 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-10 08:18:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:23,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:18:23,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:18:23,283 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-10 08:18:23,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:18:23,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:18:23,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612323532] [2024-11-10 08:18:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612323532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:18:23,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:18:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:18:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791287331] [2024-11-10 08:18:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:23,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:18:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:18:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:18:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:18:23,313 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-10 08:18:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:23,329 INFO L93 Difference]: Finished difference Result 78 states and 119 transitions. [2024-11-10 08:18:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:18:23,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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 71 [2024-11-10 08:18:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:23,337 INFO L225 Difference]: With dead ends: 78 [2024-11-10 08:18:23,337 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 08:18:23,340 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-10 08:18:23,342 INFO L432 NwaCegarLoop]: 50 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, 50 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-10 08:18:23,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:18:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 08:18:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-10 08:18:23,369 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-10 08:18:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-10 08:18:23,372 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 71 [2024-11-10 08:18:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:23,372 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-10 08:18:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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-10 08:18:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-10 08:18:23,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:18:23,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:23,375 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, 1] [2024-11-10 08:18:23,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 08:18:23,579 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-10 08:18:23,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:23,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash -562229430, now seen corresponding path program 1 times [2024-11-10 08:18:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:18:23,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35459827] [2024-11-10 08:18:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:23,583 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-10 08:18:23,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:18:23,585 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-10 08:18:23,586 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-10 08:18:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:23,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:18:23,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:18:23,983 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-10 08:18:23,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:18:24,091 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-10 08:18:24,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:18:24,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35459827] [2024-11-10 08:18:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35459827] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 08:18:24,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:18:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-10 08:18:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014942765] [2024-11-10 08:18:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:18:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:18:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:18:24,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:18:24,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:18:24,096 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10 08:18:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:18:24,354 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-11-10 08:18:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:18:24,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 71 [2024-11-10 08:18:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:18:24,356 INFO L225 Difference]: With dead ends: 86 [2024-11-10 08:18:24,357 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 08:18:24,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 133 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-10 08:18:24,358 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 153 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-10 08:18:24,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 153 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:18:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 08:18:24,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-11-10 08:18:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-10 08:18:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-10 08:18:24,375 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 71 [2024-11-10 08:18:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:18:24,376 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-10 08:18:24,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10 08:18:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-10 08:18:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 08:18:24,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:18:24,378 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, 1] [2024-11-10 08:18:24,385 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-10 08:18:24,578 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-10 08:18:24,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:18:24,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:18:24,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1180580905, now seen corresponding path program 1 times [2024-11-10 08:18:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:18:24,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914109580] [2024-11-10 08:18:24,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:18:24,580 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-10 08:18:24,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:18:24,582 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-10 08:18:24,583 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-10 08:18:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:18:24,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 08:18:24,730 INFO L278 TraceCheckSpWp]: Computing forward predicates...