./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:10,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:10,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:13:10,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:10,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:10,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:10,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:10,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:10,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:10,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:10,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:10,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:10,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:10,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:10,634 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:10,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:10,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:10,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:10,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:13:10,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:10,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:10,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:10,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:10,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:10,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:10,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:10,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:10,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:10,638 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:10,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:10,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:10,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:10,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:10,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:10,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:10,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:10,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:13:10,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:13:10,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:10,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:10,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:10,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:10,642 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 -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2024-11-12 06:13:10,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:10,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:10,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:10,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:10,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:10,943 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-50.i [2024-11-12 06:13:12,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:12,591 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:12,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2024-11-12 06:13:12,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b0b2613/f7c2a021efcb40e88332fe50dc3d9630/FLAGaae0d8f41 [2024-11-12 06:13:12,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b0b2613/f7c2a021efcb40e88332fe50dc3d9630 [2024-11-12 06:13:12,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:12,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:12,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:12,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:12,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:12,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:12,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622b9113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12, skipping insertion in model container [2024-11-12 06:13:12,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:12,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:12,843 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-50.i[915,928] [2024-11-12 06:13:12,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:12,931 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:12,943 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-50.i[915,928] [2024-11-12 06:13:12,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:12,973 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:12,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12 WrapperNode [2024-11-12 06:13:12,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:12,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:12,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:12,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:12,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:12,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,022 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-12 06:13:13,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:13,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:13,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:13,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:13,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,052 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-12 06:13:13,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:13,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:13,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:13,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:13,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (1/1) ... [2024-11-12 06:13:13,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:13,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:13,115 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-12 06:13:13,120 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-12 06:13:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:13,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:13:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:13,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:13,246 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:13,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:13,415 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:13,416 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:13,431 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:13,432 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:13,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:13 BoogieIcfgContainer [2024-11-12 06:13:13,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:13,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:13,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:13,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:13,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:12" (1/3) ... [2024-11-12 06:13:13,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b76d440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:13, skipping insertion in model container [2024-11-12 06:13:13,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:12" (2/3) ... [2024-11-12 06:13:13,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b76d440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:13, skipping insertion in model container [2024-11-12 06:13:13,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:13" (3/3) ... [2024-11-12 06:13:13,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2024-11-12 06:13:13,461 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:13,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:13,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:13,527 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;@34fa40f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:13,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:13,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 06:13:13,545 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:13,546 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:13,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1715386766, now seen corresponding path program 1 times [2024-11-12 06:13:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:13,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188184010] [2024-11-12 06:13:13,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:13,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:13:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:13:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:13:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:13:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:13:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:13:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:13:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:13:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:13:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:13:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:13:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188184010] [2024-11-12 06:13:13,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188184010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:13,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:13,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359804144] [2024-11-12 06:13:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:13,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:13,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:13,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:13,959 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:13,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:13,997 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2024-11-12 06:13:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:13,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-11-12 06:13:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:14,007 INFO L225 Difference]: With dead ends: 73 [2024-11-12 06:13:14,007 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 06:13:14,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-12 06:13:14,020 INFO L435 NwaCegarLoop]: 49 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, 49 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-12 06:13:14,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 06:13:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 06:13:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 06:13:14,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 77 [2024-11-12 06:13:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:14,085 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 06:13:14,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 06:13:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 06:13:14,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:14,089 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:14,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:13:14,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:14,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash 321635914, now seen corresponding path program 1 times [2024-11-12 06:13:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:14,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090277799] [2024-11-12 06:13:14,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:14,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:13:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703870258] [2024-11-12 06:13:14,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:14,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:13:14,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:14,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 06:13:14,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 06:13:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:14,396 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:13:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:14,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:13:14,503 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:13:14,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:13:14,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 06:13:14,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:13:14,713 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:13:14,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:13:14,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:13:14 BoogieIcfgContainer [2024-11-12 06:13:14,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:13:14,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:13:14,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:13:14,775 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:13:14,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:13" (3/4) ... [2024-11-12 06:13:14,780 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:13:14,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:13:14,782 INFO L158 Benchmark]: Toolchain (without parser) took 2164.98ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 87.9MB in the beginning and 134.1MB in the end (delta: -46.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:14,782 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:14,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.92ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 110.1MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 06:13:14,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.04ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:14,784 INFO L158 Benchmark]: Boogie Preprocessor took 48.65ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:14,784 INFO L158 Benchmark]: RCFGBuilder took 359.91ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:13:14,784 INFO L158 Benchmark]: TraceAbstraction took 1339.49ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 92.7MB in the beginning and 134.1MB in the end (delta: -41.4MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-12 06:13:14,785 INFO L158 Benchmark]: Witness Printer took 6.53ms. Allocated memory is still 186.6MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:14,787 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.92ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 110.1MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.04ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.65ms. Allocated memory is still 142.6MB. Free memory was 108.0MB in the beginning and 105.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.91ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 93.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1339.49ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 92.7MB in the beginning and 134.1MB in the end (delta: -41.4MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Witness Printer took 6.53ms. Allocated memory is still 186.6MB. Free memory is still 134.1MB. 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, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] double var_1_2 = 99999.67; [L24] double var_1_3 = -0.05; [L25] signed short int var_1_4 = 128; [L26] signed short int var_1_5 = 128; [L27] signed long int var_1_6 = -10; [L28] double var_1_7 = 8.6; [L29] unsigned char var_1_8 = 1; VAL [isInitial=0, var_1_1=5, var_1_2=9999967/100, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_double() [L46] 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_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L46] 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_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L47] var_1_3 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && 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_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L48] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L49] var_1_4 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L50] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L52] var_1_5 = __VERIFIER_nondet_short() [L53] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L53] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L56] var_1_6 = __VERIFIER_nondet_long() [L57] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L57] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L59] var_1_7 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=1] [L60] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=1] [L61] var_1_8 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1] [L62] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1] [L63] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L63] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L76] RET updateVariables() [L77] CALL step() [L33] unsigned char stepLocal_0 = ((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_1=5, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L34] COND FALSE !(stepLocal_0 && ((var_1_4 / var_1_5) < var_1_6)) [L41] var_1_1 = 10 VAL [isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3) && ((var_1_4 / var_1_5) < var_1_6)) ? ((var_1_3 >= (var_1_2 + var_1_7)) ? (var_1_1 == ((unsigned char) var_1_8)) : (var_1_1 == ((unsigned char) var_1_8))) : (var_1_1 == ((unsigned char) 10)) ; VAL [\result=0, isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=10, var_1_4=-1, var_1_5=2, var_1_6=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 12, 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, 49 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, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 76 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 264/264 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-12 06:13:14,823 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-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:17,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:17,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:13:17,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:17,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:17,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:17,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:17,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:17,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:17,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:17,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:17,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:17,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:17,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:17,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:17,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:17,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:17,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:17,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:17,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:17,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:17,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:17,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:17,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:13:17,287 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:13:17,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:17,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:13:17,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:17,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:17,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:17,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:17,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:17,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:17,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:17,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:17,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:17,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:17,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:17,293 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:13:17,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:13:17,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:17,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:17,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:17,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:17,301 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 -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2024-11-12 06:13:17,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:17,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:17,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:17,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:17,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:17,682 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-50.i [2024-11-12 06:13:19,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:19,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:19,459 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2024-11-12 06:13:19,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f407771ea/caad773b87c94eb788b1bab7dcbca508/FLAG93bad595c [2024-11-12 06:13:19,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f407771ea/caad773b87c94eb788b1bab7dcbca508 [2024-11-12 06:13:19,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:19,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:19,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:19,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:19,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:19,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:19" (1/1) ... [2024-11-12 06:13:19,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d83b526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:19, skipping insertion in model container [2024-11-12 06:13:19,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:19" (1/1) ... [2024-11-12 06:13:19,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:20,055 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-50.i[915,928] [2024-11-12 06:13:20,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:20,107 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:20,120 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-50.i[915,928] [2024-11-12 06:13:20,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:20,164 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:20,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20 WrapperNode [2024-11-12 06:13:20,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:20,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:20,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:20,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:20,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,210 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2024-11-12 06:13:20,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:20,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:20,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:20,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:20,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,240 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-12 06:13:20,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:20,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:20,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:20,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:20,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (1/1) ... [2024-11-12 06:13:20,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:20,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:20,306 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-12 06:13:20,311 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-12 06:13:20,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:13:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:20,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:20,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:20,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:20,434 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:20,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:21,089 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:21,090 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:21,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:21,102 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:21,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:21 BoogieIcfgContainer [2024-11-12 06:13:21,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:21,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:21,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:21,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:21,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:19" (1/3) ... [2024-11-12 06:13:21,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56334599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:21, skipping insertion in model container [2024-11-12 06:13:21,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:20" (2/3) ... [2024-11-12 06:13:21,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56334599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:21, skipping insertion in model container [2024-11-12 06:13:21,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:21" (3/3) ... [2024-11-12 06:13:21,110 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2024-11-12 06:13:21,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:21,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:21,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:21,186 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;@364e0823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:21,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 06:13:21,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:21,200 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:21,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:21,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:21,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1715386766, now seen corresponding path program 1 times [2024-11-12 06:13:21,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:21,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776536785] [2024-11-12 06:13:21,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:21,220 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-12 06:13:21,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:21,242 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-12 06:13:21,244 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-12 06:13:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:21,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:13:21,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-12 06:13:21,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:13:21,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776536785] [2024-11-12 06:13:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776536785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:21,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:21,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043005755] [2024-11-12 06:13:21,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:21,497 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:21,522 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2024-11-12 06:13:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:21,528 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-11-12 06:13:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:21,535 INFO L225 Difference]: With dead ends: 73 [2024-11-12 06:13:21,536 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 06:13:21,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 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-12 06:13:21,546 INFO L435 NwaCegarLoop]: 49 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, 49 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-12 06:13:21,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 06:13:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 06:13:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 06:13:21,586 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 77 [2024-11-12 06:13:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:21,588 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 06:13:21,588 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 06:13:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 06:13:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 06:13:21,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:21,593 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:21,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:13:21,794 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-12 06:13:21,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:21,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:21,796 INFO L85 PathProgramCache]: Analyzing trace with hash 321635914, now seen corresponding path program 1 times [2024-11-12 06:13:21,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:21,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826474334] [2024-11-12 06:13:21,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:21,797 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-12 06:13:21,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:21,803 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-12 06:13:21,808 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-12 06:13:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:21,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 06:13:21,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:24,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:13:24,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826474334] [2024-11-12 06:13:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826474334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:24,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:13:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113679989] [2024-11-12 06:13:24,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:24,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:13:24,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:13:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:13:24,365 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:26,789 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-11-12 06:13:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:13:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-11-12 06:13:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:26,796 INFO L225 Difference]: With dead ends: 44 [2024-11-12 06:13:26,796 INFO L226 Difference]: Without dead ends: 42 [2024-11-12 06:13:26,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:13:26,797 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:26,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 06:13:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-12 06:13:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-12 06:13:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:13:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-12 06:13:26,808 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 77 [2024-11-12 06:13:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:26,810 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-12 06:13:26,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-12 06:13:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 06:13:26,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:26,812 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:26,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:13:27,016 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-12 06:13:27,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:27,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1145218415, now seen corresponding path program 1 times [2024-11-12 06:13:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408335848] [2024-11-12 06:13:27,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:27,019 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-12 06:13:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:27,021 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-12 06:13:27,028 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-12 06:13:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:27,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 06:13:27,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:13:29,233 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:13:29,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:29,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408335848] [2024-11-12 06:13:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408335848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:29,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:29,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 06:13:29,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433604028] [2024-11-12 06:13:29,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:29,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:13:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:13:29,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:13:29,236 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:31,488 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-12 06:13:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:13:31,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-11-12 06:13:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:31,494 INFO L225 Difference]: With dead ends: 42 [2024-11-12 06:13:31,494 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:13:31,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:13:31,496 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 06:13:31,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 194 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 06:13:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:13:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:13:31,497 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-12 06:13:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:13:31,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-11-12 06:13:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:31,497 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:13:31,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:13:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:13:31,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:13:31,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:13:31,508 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-12 06:13:31,702 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-12 06:13:31,706 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 06:13:31,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:13:31,737 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:13:31,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:13:31 BoogieIcfgContainer [2024-11-12 06:13:31,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:13:31,756 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:13:31,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:13:31,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:13:31,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:21" (3/4) ... [2024-11-12 06:13:31,760 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:13:31,763 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:13:31,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-12 06:13:31,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 06:13:31,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:13:31,768 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:13:31,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:13:31,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:13:31,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:13:31,856 INFO L158 Benchmark]: Toolchain (without parser) took 12013.19ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 47.9MB in the beginning and 91.1MB in the end (delta: -43.2MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-11-12 06:13:31,856 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 50.3MB. Free memory was 25.0MB in the beginning and 24.9MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:31,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.64ms. Allocated memory is still 69.2MB. Free memory was 47.7MB in the beginning and 33.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:13:31,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.58ms. Allocated memory is still 69.2MB. Free memory was 33.7MB in the beginning and 31.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:31,857 INFO L158 Benchmark]: Boogie Preprocessor took 54.77ms. Allocated memory is still 69.2MB. Free memory was 31.9MB in the beginning and 29.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:31,857 INFO L158 Benchmark]: RCFGBuilder took 831.25ms. Allocated memory is still 69.2MB. Free memory was 29.6MB in the beginning and 37.4MB in the end (delta: -7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:13:31,857 INFO L158 Benchmark]: TraceAbstraction took 10651.15ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 36.8MB in the beginning and 96.3MB in the end (delta: -59.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:31,857 INFO L158 Benchmark]: Witness Printer took 99.41ms. Allocated memory is still 121.6MB. Free memory was 96.3MB in the beginning and 91.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:13:31,860 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.25ms. Allocated memory is still 50.3MB. Free memory was 25.0MB in the beginning and 24.9MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.64ms. Allocated memory is still 69.2MB. Free memory was 47.7MB in the beginning and 33.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.58ms. Allocated memory is still 69.2MB. Free memory was 33.7MB in the beginning and 31.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.77ms. Allocated memory is still 69.2MB. Free memory was 31.9MB in the beginning and 29.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 831.25ms. Allocated memory is still 69.2MB. Free memory was 29.6MB in the beginning and 37.4MB in the end (delta: -7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10651.15ms. Allocated memory was 69.2MB in the beginning and 121.6MB in the end (delta: 52.4MB). Free memory was 36.8MB in the beginning and 96.3MB in the end (delta: -59.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Witness Printer took 99.41ms. Allocated memory is still 121.6MB. Free memory was 96.3MB in the beginning and 91.1MB in the end (delta: 5.2MB). 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 141 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 16 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((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_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:13:31,914 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