./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.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-99.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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:20:03,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:20:03,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:20:03,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:20:03,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:20:03,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:20:03,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:20:03,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:20:03,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:20:03,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:20:03,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:20:03,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:20:03,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:20:03,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:20:03,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:20:03,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:20:03,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:20:03,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:20:03,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:20:03,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:20:03,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:20:03,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:20:03,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:20:03,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:20:03,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:20:03,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:20:03,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:20:03,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:20:03,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:20:03,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:20:03,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:20:03,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:20:03,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:03,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:20:03,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:20:03,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:20:03,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:20:03,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:20:03,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:20:03,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:20:03,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:20:03,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:20:03,636 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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2024-11-10 08:20:03,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:20:03,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:20:03,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:20:03,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:20:03,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:20:03,846 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-99.i [2024-11-10 08:20:05,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:20:05,174 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:20:05,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2024-11-10 08:20:05,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e2e3c76/03aef8b3914647bc8179c8788abbd7f1/FLAG87c84119f [2024-11-10 08:20:05,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e2e3c76/03aef8b3914647bc8179c8788abbd7f1 [2024-11-10 08:20:05,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:20:05,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:20:05,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:05,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:20:05,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:20:05,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c38626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05, skipping insertion in model container [2024-11-10 08:20:05,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:20:05,379 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-99.i[915,928] [2024-11-10 08:20:05,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:05,422 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:20:05,430 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-99.i[915,928] [2024-11-10 08:20:05,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:05,453 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:20:05,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05 WrapperNode [2024-11-10 08:20:05,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:05,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:05,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:20:05,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:20:05,458 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:20:05" (1/1) ... [2024-11-10 08:20:05,467 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:20:05" (1/1) ... [2024-11-10 08:20:05,486 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-10 08:20:05,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:05,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:20:05,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:20:05,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:20:05,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,506 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:20:05,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:20:05,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:20:05,519 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:20:05,519 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:20:05,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (1/1) ... [2024-11-10 08:20:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:20:05,550 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:20:05,553 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:20:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:20:05,590 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:20:05,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:20:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:20:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:20:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:20:05,650 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:20:05,652 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:20:05,829 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:20:05,829 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:20:05,839 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:20:05,839 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:20:05,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:05 BoogieIcfgContainer [2024-11-10 08:20:05,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:20:05,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:20:05,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:20:05,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:20:05,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:20:05" (1/3) ... [2024-11-10 08:20:05,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495580e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:05, skipping insertion in model container [2024-11-10 08:20:05,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:05" (2/3) ... [2024-11-10 08:20:05,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495580e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:05, skipping insertion in model container [2024-11-10 08:20:05,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:05" (3/3) ... [2024-11-10 08:20:05,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2024-11-10 08:20:05,859 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:20:05,859 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:20:05,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:20:05,901 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;@178deeb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:20:05,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:20:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 08:20:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 08:20:05,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:05,920 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:05,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:05,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash -67253938, now seen corresponding path program 1 times [2024-11-10 08:20:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599133763] [2024-11-10 08:20:05,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:20:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:20:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:20:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-10 08:20:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:20:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 08:20:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:20:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:20:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 08:20:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 08:20:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 08:20:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 08:20:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:20:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:20:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:20:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599133763] [2024-11-10 08:20:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599133763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:06,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:06,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:20:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382723653] [2024-11-10 08:20:06,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:06,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:20:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:20:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:20:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:20:06,207 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:20:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:06,223 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2024-11-10 08:20:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:20:06,226 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-10 08:20:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:06,231 INFO L225 Difference]: With dead ends: 82 [2024-11-10 08:20:06,232 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 08:20:06,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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:20:06,236 INFO L432 NwaCegarLoop]: 53 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, 53 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:20:06,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 08:20:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 08:20:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 08:20:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-10 08:20:06,266 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 86 [2024-11-10 08:20:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:06,266 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-10 08:20:06,266 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:20:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-10 08:20:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 08:20:06,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:06,269 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:06,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:20:06,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:06,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 146747531, now seen corresponding path program 1 times [2024-11-10 08:20:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:20:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580491786] [2024-11-10 08:20:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:20:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:20:06,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:20:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:20:06,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:20:06,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:20:06,451 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:20:06,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:20:06,454 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 08:20:06,505 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:20:06,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:20:06 BoogieIcfgContainer [2024-11-10 08:20:06,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:20:06,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:20:06,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:20:06,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:20:06,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:05" (3/4) ... [2024-11-10 08:20:06,513 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:20:06,514 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:20:06,514 INFO L158 Benchmark]: Toolchain (without parser) took 1320.18ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 82.1MB in the beginning and 173.4MB in the end (delta: -91.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:06,515 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:06,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.03ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 122.3MB in the end (delta: -40.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-10 08:20:06,516 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.89ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 120.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:06,517 INFO L158 Benchmark]: Boogie Preprocessor took 30.82ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:06,517 INFO L158 Benchmark]: IcfgBuilder took 321.48ms. Allocated memory is still 153.1MB. Free memory was 118.0MB in the beginning and 103.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:20:06,518 INFO L158 Benchmark]: TraceAbstraction took 667.42ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 103.4MB in the beginning and 173.4MB in the end (delta: -70.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:06,518 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 216.0MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:06,519 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.03ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 122.3MB in the end (delta: -40.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.89ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 120.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.82ms. Allocated memory is still 153.1MB. Free memory was 120.2MB in the beginning and 118.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 321.48ms. Allocated memory is still 153.1MB. Free memory was 118.0MB in the beginning and 103.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 667.42ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 103.4MB in the beginning and 173.4MB in the end (delta: -70.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 216.0MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 3.25; [L24] double var_1_3 = 32.75; [L25] double var_1_4 = 128.75; [L26] unsigned char var_1_6 = 32; [L27] unsigned char var_1_7 = 32; [L28] unsigned char var_1_8 = 16; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] signed short int var_1_12 = 10; VAL [isInitial=0, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_2=13/4, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L45] var_1_3 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L46] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L47] var_1_4 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L48] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L49] var_1_6 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L50] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L51] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L51] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L52] var_1_7 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_7 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L53] RET assume_abort_if_not(var_1_7 >= 32) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L54] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L54] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=16, var_1_9=0] [L55] var_1_8 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_9=0] [L56] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_9=0] [L57] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=0] [L57] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=0] [L58] var_1_9 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0] [L59] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0] [L60] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L60] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L61] var_1_11 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L62] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L63] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L63] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L76] RET updateVariables() [L77] CALL step() [L36] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L37] COND FALSE !((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L40] var_1_12 = var_1_1 VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) ? (var_1_1 == ((unsigned char) (((var_1_6 + var_1_7) - var_1_8) + var_1_9))) : 1) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((signed short int) var_1_1)) ; VAL [\result=0, isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=31, var_1_7=32, var_1_8=0, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 85 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 312/312 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:20:06,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:20:08,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:20:08,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:20:08,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:20:08,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:20:08,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:20:08,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:20:08,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:20:08,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:20:08,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:20:08,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:20:08,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:20:08,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:20:08,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:20:08,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:20:08,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:20:08,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:20:08,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:20:08,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:20:08,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:20:08,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:20:08,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:20:08,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:20:08,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:20:08,416 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:20:08,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:20:08,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:20:08,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:20:08,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:20:08,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:20:08,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:20:08,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:20:08,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:20:08,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:20:08,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:08,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:20:08,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:20:08,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:20:08,420 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:20:08,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:20:08,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:20:08,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:20:08,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:20:08,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:20:08,421 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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2024-11-10 08:20:08,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:20:08,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:20:08,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:20:08,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:20:08,684 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:20:08,685 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-99.i [2024-11-10 08:20:09,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:20:10,069 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:20:10,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2024-11-10 08:20:10,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e90ef50/90a137db16914efbbc4e2aa821eba8b3/FLAG61cf36ef3 [2024-11-10 08:20:10,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89e90ef50/90a137db16914efbbc4e2aa821eba8b3 [2024-11-10 08:20:10,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:20:10,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:20:10,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:10,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:20:10,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:20:10,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9e5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10, skipping insertion in model container [2024-11-10 08:20:10,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:20:10,637 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-99.i[915,928] [2024-11-10 08:20:10,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:10,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:20:10,699 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-99.i[915,928] [2024-11-10 08:20:10,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:20:10,734 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:20:10,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10 WrapperNode [2024-11-10 08:20:10,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:20:10,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:10,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:20:10,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:20:10,754 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:20:10" (1/1) ... [2024-11-10 08:20:10,768 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:20:10" (1/1) ... [2024-11-10 08:20:10,788 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-10 08:20:10,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:20:10,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:20:10,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:20:10,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:20:10,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,814 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:20:10,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:20:10,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:20:10,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:20:10,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:20:10,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (1/1) ... [2024-11-10 08:20:10,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:20:10,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:20:10,862 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:20:10,864 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:20:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:20:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:20:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:20:10,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:20:10,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:20:10,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:20:10,956 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:20:10,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:20:11,341 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:20:11,341 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:20:11,352 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:20:11,353 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:20:11,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:11 BoogieIcfgContainer [2024-11-10 08:20:11,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:20:11,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:20:11,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:20:11,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:20:11,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:20:10" (1/3) ... [2024-11-10 08:20:11,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b752af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:11, skipping insertion in model container [2024-11-10 08:20:11,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:20:10" (2/3) ... [2024-11-10 08:20:11,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b752af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:20:11, skipping insertion in model container [2024-11-10 08:20:11,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:11" (3/3) ... [2024-11-10 08:20:11,359 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2024-11-10 08:20:11,371 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:20:11,372 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:20:11,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:20:11,419 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;@7577b757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:20:11,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:20:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 08:20:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 08:20:11,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:11,431 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:11,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:11,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:11,437 INFO L85 PathProgramCache]: Analyzing trace with hash -67253938, now seen corresponding path program 1 times [2024-11-10 08:20:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:20:11,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824003932] [2024-11-10 08:20:11,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:11,448 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:20:11,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:20:11,452 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:20:11,453 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:20:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:11,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:20:11,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:20:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-10 08:20:11,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:20:11,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:20:11,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824003932] [2024-11-10 08:20:11,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824003932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:11,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:11,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:20:11,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639147054] [2024-11-10 08:20:11,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:11,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:20:11,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:20:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:20:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:20:11,704 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:20:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:11,720 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2024-11-10 08:20:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:20:11,721 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-10 08:20:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:11,726 INFO L225 Difference]: With dead ends: 82 [2024-11-10 08:20:11,726 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 08:20:11,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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:20:11,731 INFO L432 NwaCegarLoop]: 53 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, 53 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:20:11,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:20:11,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 08:20:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 08:20:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 08:20:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-10 08:20:11,757 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 86 [2024-11-10 08:20:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:11,757 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-10 08:20:11,757 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:20:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-10 08:20:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 08:20:11,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:11,760 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:11,766 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:20:11,961 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:20:11,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:11,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:11,962 INFO L85 PathProgramCache]: Analyzing trace with hash 146747531, now seen corresponding path program 1 times [2024-11-10 08:20:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:20:11,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113143668] [2024-11-10 08:20:11,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:11,963 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:20:11,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:20:11,964 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:20:11,965 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:20:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:12,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 08:20:12,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:20:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-10 08:20:15,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:20:15,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:20:15,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113143668] [2024-11-10 08:20:15,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113143668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:20:15,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:20:15,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 08:20:15,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367536390] [2024-11-10 08:20:15,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:15,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 08:20:15,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:20:15,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 08:20:15,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-10 08:20:15,259 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:20:21,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:21,739 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-11-10 08:20:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 08:20:21,744 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-10 08:20:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:21,746 INFO L225 Difference]: With dead ends: 64 [2024-11-10 08:20:21,746 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 08:20:21,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:20:21,747 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:21,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 186 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 08:20:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 08:20:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2024-11-10 08:20:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 08:20:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2024-11-10 08:20:21,756 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 86 [2024-11-10 08:20:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:21,756 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2024-11-10 08:20:21,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:20:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2024-11-10 08:20:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 08:20:21,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:20:21,758 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:21,764 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:20:21,958 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:20:21,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:20:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:20:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash -740756150, now seen corresponding path program 1 times [2024-11-10 08:20:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:20:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006077681] [2024-11-10 08:20:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:20:21,961 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:20:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:20:21,962 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:20:21,963 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:20:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:20:22,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 08:20:22,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:20:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-10 08:20:23,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:20:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:20:23,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:20:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006077681] [2024-11-10 08:20:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006077681] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 08:20:23,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:20:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2024-11-10 08:20:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864075278] [2024-11-10 08:20:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:20:23,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:20:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:20:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:20:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-11-10 08:20:23,540 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:20:24,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:20:24,055 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2024-11-10 08:20:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:20:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2024-11-10 08:20:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:20:24,058 INFO L225 Difference]: With dead ends: 66 [2024-11-10 08:20:24,059 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 08:20:24,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2024-11-10 08:20:24,061 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 60 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:20:24,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 08:20:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 08:20:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 08:20:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 08:20:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 08:20:24,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2024-11-10 08:20:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:20:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 08:20:24,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:20:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 08:20:24,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 08:20:24,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:20:24,073 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 (4)] Ended with exit code 0 [2024-11-10 08:20:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:20:24,270 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 08:20:24,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 08:20:25,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:20:25,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:20:25 BoogieIcfgContainer [2024-11-10 08:20:25,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:20:25,367 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:20:25,367 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:20:25,367 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:20:25,368 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:20:11" (3/4) ... [2024-11-10 08:20:25,369 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 08:20:25,376 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 08:20:25,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 08:20:25,381 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 08:20:25,381 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 08:20:25,381 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 08:20:25,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 08:20:25,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 08:20:25,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:20:25,466 INFO L158 Benchmark]: Toolchain (without parser) took 14993.72ms. Allocated memory is still 92.3MB. Free memory was 63.8MB in the beginning and 60.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:25,466 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 60.8MB. Free memory was 32.3MB in the beginning and 32.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:20:25,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.62ms. Allocated memory is still 92.3MB. Free memory was 63.6MB in the beginning and 49.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 08:20:25,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.77ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 71.2MB in the end (delta: -21.6MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-10 08:20:25,467 INFO L158 Benchmark]: Boogie Preprocessor took 40.21ms. Allocated memory is still 92.3MB. Free memory was 71.2MB in the beginning and 68.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:20:25,467 INFO L158 Benchmark]: IcfgBuilder took 522.38ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 55.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 08:20:25,467 INFO L158 Benchmark]: TraceAbstraction took 14012.52ms. Allocated memory is still 92.3MB. Free memory was 54.6MB in the beginning and 65.5MB in the end (delta: -10.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-10 08:20:25,467 INFO L158 Benchmark]: Witness Printer took 98.19ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 60.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:20:25,469 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.73ms. Allocated memory is still 60.8MB. Free memory was 32.3MB in the beginning and 32.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.62ms. Allocated memory is still 92.3MB. Free memory was 63.6MB in the beginning and 49.6MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.77ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 71.2MB in the end (delta: -21.6MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.21ms. Allocated memory is still 92.3MB. Free memory was 71.2MB in the beginning and 68.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 522.38ms. Allocated memory is still 92.3MB. Free memory was 68.9MB in the beginning and 55.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14012.52ms. Allocated memory is still 92.3MB. Free memory was 54.6MB in the beginning and 65.5MB in the end (delta: -10.8MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 98.19ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 60.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 319 IncrementalHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 152 mSDtfsCounter, 319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=2, InterpolantAutomatonStates: 25, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 28 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1185/1248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12)))) RESULT: Ultimate proved your program to be correct! [2024-11-10 08:20:25,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE