./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-3.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 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:32:47,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:32:47,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:32:47,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:32:47,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:32:47,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:32:47,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:32:47,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:32:47,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:32:47,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:32:47,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:32:47,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:32:47,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:32:47,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:32:47,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:32:47,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:32:47,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:32:47,935 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:32:47,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:32:47,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:32:47,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:32:47,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:32:47,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:32:47,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:32:47,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:32:47,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:32:47,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:32:47,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:32:47,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:32:47,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:32:47,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:32:47,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:32:47,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:47,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:32:47,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:32:47,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:32:47,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:32:47,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:32:47,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:32:47,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:32:47,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:32:47,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:32:47,948 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 -> 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 [2024-11-09 00:32:48,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:32:48,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:32:48,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:32:48,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:32:48,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:32:48,250 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-3.i [2024-11-09 00:32:49,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:32:49,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:32:49,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-09 00:32:49,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea9a8c4c/811d48d0490545fb8e7cf68dd907b190/FLAGcf0c2ffd6 [2024-11-09 00:32:50,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea9a8c4c/811d48d0490545fb8e7cf68dd907b190 [2024-11-09 00:32:50,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:32:50,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:32:50,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:50,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:32:50,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:32:50,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7832251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50, skipping insertion in model container [2024-11-09 00:32:50,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:32:50,538 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-3.i[914,927] [2024-11-09 00:32:50,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:50,585 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:32:50,596 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-3.i[914,927] [2024-11-09 00:32:50,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:50,623 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:32:50,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50 WrapperNode [2024-11-09 00:32:50,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:50,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:50,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:32:50,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:32:50,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,660 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2024-11-09 00:32:50,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:50,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:32:50,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:32:50,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:32:50,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,692 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-09 00:32:50,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:32:50,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:32:50,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:32:50,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:32:50,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (1/1) ... [2024-11-09 00:32:50,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:50,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:32:50,752 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-09 00:32:50,754 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-09 00:32:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:32:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:32:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:32:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:32:50,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:32:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:32:50,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:32:50,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:32:51,039 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:32:51,039 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:32:51,054 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:32:51,054 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:32:51,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:51 BoogieIcfgContainer [2024-11-09 00:32:51,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:32:51,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:32:51,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:32:51,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:32:51,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:50" (1/3) ... [2024-11-09 00:32:51,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582cee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:51, skipping insertion in model container [2024-11-09 00:32:51,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:50" (2/3) ... [2024-11-09 00:32:51,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582cee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:51, skipping insertion in model container [2024-11-09 00:32:51,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:51" (3/3) ... [2024-11-09 00:32:51,063 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-3.i [2024-11-09 00:32:51,077 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:32:51,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:32:51,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:32:51,138 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;@3ffd6c41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:32:51,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:32:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:32:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:32:51,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:51,149 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:32:51,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:51,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 209972596, now seen corresponding path program 1 times [2024-11-09 00:32:51,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:32:51,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715062413] [2024-11-09 00:32:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:32:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:32:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:32:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:32:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:32:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:32:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:32:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:32:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:32:51,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:32:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715062413] [2024-11-09 00:32:51,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715062413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:51,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:51,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:32:51,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334697059] [2024-11-09 00:32:51,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:51,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:32:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:32:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:32:51,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:51,483 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:32:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:51,501 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-09 00:32:51,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:32:51,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-11-09 00:32:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:51,509 INFO L225 Difference]: With dead ends: 67 [2024-11-09 00:32:51,509 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 00:32:51,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-09 00:32:51,515 INFO L432 NwaCegarLoop]: 45 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, 45 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-09 00:32:51,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:32:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 00:32:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 00:32:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:32:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-11-09 00:32:51,549 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 55 [2024-11-09 00:32:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:51,549 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-09 00:32:51,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:32:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-11-09 00:32:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:32:51,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:51,552 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:32:51,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:32:51,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:51,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1544713484, now seen corresponding path program 1 times [2024-11-09 00:32:51,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:32:51,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46350507] [2024-11-09 00:32:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:51,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:32:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:51,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:32:51,736 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:32:51,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:32:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:32:51,743 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:32:51,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:32:51,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:32:51 BoogieIcfgContainer [2024-11-09 00:32:51,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:32:51,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:32:51,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:32:51,794 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:32:51,794 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:51" (3/4) ... [2024-11-09 00:32:51,796 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:32:51,797 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:32:51,798 INFO L158 Benchmark]: Toolchain (without parser) took 1470.83ms. Allocated memory is still 157.3MB. Free memory was 123.4MB in the beginning and 85.8MB in the end (delta: 37.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-09 00:32:51,798 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:51,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.03ms. Allocated memory is still 157.3MB. Free memory was 123.4MB in the beginning and 109.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:32:51,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.08ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:51,799 INFO L158 Benchmark]: Boogie Preprocessor took 55.15ms. Allocated memory is still 157.3MB. Free memory was 107.6MB in the beginning and 105.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:32:51,800 INFO L158 Benchmark]: RCFGBuilder took 338.11ms. Allocated memory is still 157.3MB. Free memory was 105.6MB in the beginning and 122.5MB in the end (delta: -16.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:32:51,801 INFO L158 Benchmark]: TraceAbstraction took 735.98ms. Allocated memory is still 157.3MB. Free memory was 122.5MB in the beginning and 85.8MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 00:32:51,801 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 157.3MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:51,803 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.03ms. Allocated memory is still 157.3MB. Free memory was 123.4MB in the beginning and 109.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.08ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 107.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.15ms. Allocated memory is still 157.3MB. Free memory was 107.6MB in the beginning and 105.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 338.11ms. Allocated memory is still 157.3MB. Free memory was 105.6MB in the beginning and 122.5MB in the end (delta: -16.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 735.98ms. Allocated memory is still 157.3MB. Free memory was 122.5MB in the beginning and 85.8MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 157.3MB. Free memory is still 85.8MB. 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 someBinaryFLOATComparisonOperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] float var_1_2 = 128.2; [L24] unsigned char var_1_3 = 1; [L25] float var_1_4 = 32.32; [L26] unsigned char var_1_5 = 0; [L27] signed short int var_1_6 = 64; VAL [isInitial=0, var_1_1=25, var_1_2=641/5, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L46] var_1_2 = __VERIFIER_nondet_float() [L47] 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=25, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L47] 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=25, var_1_3=1, var_1_4=808/25, var_1_5=0, var_1_6=64] [L48] var_1_3 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_4=808/25, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_4=808/25, var_1_5=0, var_1_6=64] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=25, var_1_4=808/25, var_1_5=0, var_1_6=64] [L50] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_4=808/25, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_4=808/25, var_1_5=0, var_1_6=64] [L50] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_4=808/25, var_1_5=0, var_1_6=64] [L51] var_1_4 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=0, var_1_6=64] [L52] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=0, var_1_6=64] [L53] var_1_5 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_6=64] [L54] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_6=64] [L55] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=64] [L55] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=64] [L56] var_1_6 = __VERIFIER_nondet_short() [L57] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L57] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L58] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L58] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L71] RET updateVariables() [L72] CALL step() [L31] COND FALSE !(99999.8f < var_1_2) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L72] RET step() [L73] CALL, EXPR property() [L63-L64] return (99999.8f < var_1_2) ? ((! var_1_3) ? ((var_1_2 >= (var_1_4 / 2.5f)) ? (var_1_3 ? (var_1_5 ? (var_1_1 == ((signed short int) var_1_6)) : 1) : (var_1_1 == ((signed short int) var_1_6))) : 1) : 1) : 1 ; VAL [\result=0, isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] [L19] reach_error() VAL [isInitial=1, var_1_1=25, var_1_3=0, var_1_5=1, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 8, 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, 45 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, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 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-09 00:32:51,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.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 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:32:54,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:32:54,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:32:54,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:32:54,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:32:54,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:32:54,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:32:54,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:32:54,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:32:54,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:32:54,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:32:54,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:32:54,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:32:54,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:32:54,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:32:54,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:32:54,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:32:54,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:32:54,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:32:54,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:32:54,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:32:54,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:32:54,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:32:54,225 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:32:54,225 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:32:54,226 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:32:54,226 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:32:54,226 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:32:54,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:32:54,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:32:54,227 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:32:54,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:32:54,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:32:54,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:32:54,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:54,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:32:54,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:32:54,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:32:54,233 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:32:54,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:32:54,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:32:54,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:32:54,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:32:54,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:32:54,234 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 -> 1f37f28e985fa9cd213de5b59fc80c1b7aa5c342cca2d3369965275ac128fee1 [2024-11-09 00:32:54,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:32:54,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:32:54,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:32:54,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:32:54,581 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:32:54,582 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-3.i [2024-11-09 00:32:56,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:32:56,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:32:56,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-3.i [2024-11-09 00:32:56,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9ecdb93/c3abe19b73014cf186288386123de151/FLAG79abe2897 [2024-11-09 00:32:56,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9ecdb93/c3abe19b73014cf186288386123de151 [2024-11-09 00:32:56,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:32:56,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:32:56,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:56,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:32:56,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:32:56,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:56" (1/1) ... [2024-11-09 00:32:56,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e391a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:56, skipping insertion in model container [2024-11-09 00:32:56,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:56" (1/1) ... [2024-11-09 00:32:56,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:32:56,919 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-3.i[914,927] [2024-11-09 00:32:56,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:56,979 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:32:56,991 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-3.i[914,927] [2024-11-09 00:32:57,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:57,031 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:32:57,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57 WrapperNode [2024-11-09 00:32:57,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:57,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:57,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:32:57,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:32:57,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,073 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2024-11-09 00:32:57,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:57,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:32:57,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:32:57,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:32:57,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,108 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-09 00:32:57,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:32:57,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:32:57,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:32:57,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:32:57,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (1/1) ... [2024-11-09 00:32:57,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:32:57,176 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-09 00:32:57,180 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-09 00:32:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:32:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:32:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:32:57,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:32:57,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:32:57,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:32:57,326 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:32:57,329 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:32:58,080 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:32:58,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:32:58,096 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:32:58,097 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:32:58,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:58 BoogieIcfgContainer [2024-11-09 00:32:58,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:32:58,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:32:58,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:32:58,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:32:58,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:56" (1/3) ... [2024-11-09 00:32:58,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d501098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:58, skipping insertion in model container [2024-11-09 00:32:58,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:57" (2/3) ... [2024-11-09 00:32:58,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d501098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:58, skipping insertion in model container [2024-11-09 00:32:58,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:58" (3/3) ... [2024-11-09 00:32:58,106 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-3.i [2024-11-09 00:32:58,122 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:32:58,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:32:58,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:32:58,199 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;@5617a1e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:32:58,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:32:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:32:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:32:58,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:58,218 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:32:58,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:58,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash 209972596, now seen corresponding path program 1 times [2024-11-09 00:32:58,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277222733] [2024-11-09 00:32:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:58,235 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-09 00:32:58,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:58,238 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-09 00:32:58,240 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-09 00:32:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:58,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:32:58,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 00:32:58,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:32:58,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277222733] [2024-11-09 00:32:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277222733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:58,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:58,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:32:58,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749990032] [2024-11-09 00:32:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:58,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:32:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:32:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:58,535 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:32:58,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:58,561 INFO L93 Difference]: Finished difference Result 67 states and 106 transitions. [2024-11-09 00:32:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:32:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-11-09 00:32:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:58,572 INFO L225 Difference]: With dead ends: 67 [2024-11-09 00:32:58,572 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 00:32:58,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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-09 00:32:58,581 INFO L432 NwaCegarLoop]: 45 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, 45 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-09 00:32:58,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:32:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 00:32:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 00:32:58,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:32:58,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-11-09 00:32:58,617 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 55 [2024-11-09 00:32:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:58,617 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-09 00:32:58,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 00:32:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2024-11-09 00:32:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 00:32:58,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:58,620 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 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-09 00:32:58,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:32:58,821 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-09 00:32:58,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:58,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1544713484, now seen corresponding path program 1 times [2024-11-09 00:32:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:58,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691505089] [2024-11-09 00:32:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:58,824 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-09 00:32:58,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:58,829 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-09 00:32:58,830 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-09 00:32:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:58,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:32:59,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:33:05,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:05,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691505089] [2024-11-09 00:33:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691505089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:05,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:05,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:33:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356047264] [2024-11-09 00:33:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:05,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:33:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:05,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:33:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:33:05,583 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:06,772 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2024-11-09 00:33:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:33:06,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-11-09 00:33:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:06,775 INFO L225 Difference]: With dead ends: 41 [2024-11-09 00:33:06,775 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 00:33:06,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:33:06,776 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:06,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 158 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 00:33:06,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 00:33:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-09 00:33:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-09 00:33:06,784 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 55 [2024-11-09 00:33:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:06,785 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-09 00:33:06,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-09 00:33:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 00:33:06,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:06,787 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:06,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:33:06,988 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-09 00:33:06,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:06,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:06,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1390515739, now seen corresponding path program 1 times [2024-11-09 00:33:06,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:06,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643483577] [2024-11-09 00:33:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:06,991 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-09 00:33:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:06,994 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-09 00:33:06,995 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-09 00:33:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:07,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:33:07,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:33:10,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:10,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:10,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643483577] [2024-11-09 00:33:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643483577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:33:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024831958] [2024-11-09 00:33:10,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:10,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:33:10,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:10,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:33:10,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:33:10,076 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:11,745 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-11-09 00:33:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:33:11,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-11-09 00:33:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:11,747 INFO L225 Difference]: With dead ends: 47 [2024-11-09 00:33:11,747 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 00:33:11,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:33:11,749 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 26 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:11,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 165 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 00:33:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 00:33:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2024-11-09 00:33:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2024-11-09 00:33:11,761 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 56 [2024-11-09 00:33:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:11,761 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2024-11-09 00:33:11,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2024-11-09 00:33:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 00:33:11,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:11,767 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:11,777 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 00:33:11,967 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-09 00:33:11,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:11,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:11,969 INFO L85 PathProgramCache]: Analyzing trace with hash -736348597, now seen corresponding path program 1 times [2024-11-09 00:33:11,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962558512] [2024-11-09 00:33:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:11,970 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-09 00:33:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:11,973 INFO L229 MonitoredProcess]: Starting monitored process 5 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-09 00:33:11,974 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 (5)] Waiting until timeout for monitored process [2024-11-09 00:33:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:12,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:33:12,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:33:14,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:14,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962558512] [2024-11-09 00:33:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962558512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:14,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:33:14,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696372112] [2024-11-09 00:33:14,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:14,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:33:14,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:14,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:33:14,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:33:14,955 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:21,194 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2024-11-09 00:33:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:33:21,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-11-09 00:33:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:21,204 INFO L225 Difference]: With dead ends: 83 [2024-11-09 00:33:21,204 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 00:33:21,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:33:21,206 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:21,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 193 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 00:33:21,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 00:33:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2024-11-09 00:33:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 00:33:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2024-11-09 00:33:21,212 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 57 [2024-11-09 00:33:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:21,213 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2024-11-09 00:33:21,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2024-11-09 00:33:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 00:33:21,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:33:21,214 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:33:21,225 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:33:21,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-09 00:33:21,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:33:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:33:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1762999332, now seen corresponding path program 1 times [2024-11-09 00:33:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:33:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140191010] [2024-11-09 00:33:21,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:33:21,420 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-09 00:33:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:33:21,422 INFO L229 MonitoredProcess]: Starting monitored process 6 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-09 00:33:21,423 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 (6)] Waiting until timeout for monitored process [2024-11-09 00:33:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:33:21,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 00:33:21,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:33:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 00:33:27,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:33:27,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:33:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140191010] [2024-11-09 00:33:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140191010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:33:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:33:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:33:27,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402989251] [2024-11-09 00:33:27,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:33:27,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:33:27,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:33:27,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:33:27,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:33:27,461 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:33:32,542 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-09 00:33:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:33:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 58 [2024-11-09 00:33:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:33:32,549 INFO L225 Difference]: With dead ends: 50 [2024-11-09 00:33:32,549 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:33:32,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:33:32,550 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:33:32,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 00:33:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:33:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:33:32,551 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-09 00:33:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:33:32,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2024-11-09 00:33:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:33:32,552 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:33:32,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-09 00:33:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:33:32,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:33:32,557 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:33:32,568 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 (6)] Ended with exit code 0 [2024-11-09 00:33:32,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-09 00:33:32,765 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 00:33:32,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:33:32,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:33:32,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:33:32 BoogieIcfgContainer [2024-11-09 00:33:32,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:33:32,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:33:32,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:33:32,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:33:32,811 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:58" (3/4) ... [2024-11-09 00:33:32,814 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:33:32,821 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:33:32,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 00:33:32,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:33:32,832 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:33:32,833 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:33:32,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:33:32,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:33:32,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:33:32,962 INFO L158 Benchmark]: Toolchain (without parser) took 36277.91ms. Allocated memory was 62.9MB in the beginning and 96.5MB in the end (delta: 33.6MB). Free memory was 24.9MB in the beginning and 69.5MB in the end (delta: -44.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:32,962 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:33:32,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.21ms. Allocated memory is still 62.9MB. Free memory was 24.7MB in the beginning and 31.1MB in the end (delta: -6.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-09 00:33:32,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 62.9MB. Free memory was 31.1MB in the beginning and 29.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:33:32,963 INFO L158 Benchmark]: Boogie Preprocessor took 61.35ms. Allocated memory is still 62.9MB. Free memory was 29.4MB in the beginning and 27.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:33:32,963 INFO L158 Benchmark]: RCFGBuilder took 960.61ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 27.1MB in the beginning and 50.6MB in the end (delta: -23.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:33:32,963 INFO L158 Benchmark]: TraceAbstraction took 34706.02ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 50.0MB in the beginning and 74.6MB in the end (delta: -24.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-09 00:33:32,964 INFO L158 Benchmark]: Witness Printer took 154.67ms. Allocated memory is still 96.5MB. Free memory was 74.6MB in the beginning and 69.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:33:32,966 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.21ms. Allocated memory is still 62.9MB. Free memory was 24.7MB in the beginning and 31.1MB in the end (delta: -6.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 62.9MB. Free memory was 31.1MB in the beginning and 29.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.35ms. Allocated memory is still 62.9MB. Free memory was 29.4MB in the beginning and 27.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 960.61ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 27.1MB in the beginning and 50.6MB in the end (delta: -23.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34706.02ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 50.0MB in the beginning and 74.6MB in the end (delta: -24.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Witness Printer took 154.67ms. Allocated memory is still 96.5MB. Free memory was 74.6MB in the beginning and 69.5MB in the end (delta: 5.0MB). 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 5, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 762 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 230 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 28, 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, 5 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 386 SizeOfPredicates, 28 NumberOfNonLiveVariables, 467 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 560/560 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: 69]: 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))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:33:33,015 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