./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.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-18.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 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:32:19,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:32:19,901 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:19,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:32:19,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:32:19,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:32:19,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:32:19,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:32:19,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:32:19,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:32:19,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:32:19,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:32:19,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:32:19,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:32:19,950 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:32:19,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:32:19,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:32:19,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:32:19,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:32:19,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:32:19,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:32:19,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:32:19,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:32:19,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:32:19,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:32:19,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:32:19,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:32:19,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:32:19,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:32:19,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:32:19,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:32:19,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:32:19,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:19,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:32:19,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:32:19,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:32:19,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:32:19,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:32:19,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:32:19,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:32:19,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:32:19,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:32:19,960 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 -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2024-11-09 00:32:20,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:32:20,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:32:20,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:32:20,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:32:20,271 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:32:20,273 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-18.i [2024-11-09 00:32:21,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:32:22,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:32:22,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2024-11-09 00:32:22,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01bde985/17bd7b0b80e44a65b916bae7373fe500/FLAG75221ac9a [2024-11-09 00:32:22,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d01bde985/17bd7b0b80e44a65b916bae7373fe500 [2024-11-09 00:32:22,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:32:22,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:32:22,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:22,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:32:22,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:32:22,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72072722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22, skipping insertion in model container [2024-11-09 00:32:22,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:32:22,745 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-18.i[915,928] [2024-11-09 00:32:22,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:22,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:32:22,794 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-18.i[915,928] [2024-11-09 00:32:22,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:22,858 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:32:22,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22 WrapperNode [2024-11-09 00:32:22,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:22,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:22,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:32:22,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:32:22,870 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:22" (1/1) ... [2024-11-09 00:32:22,878 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:22" (1/1) ... [2024-11-09 00:32:22,899 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-11-09 00:32:22,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:22,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:32:22,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:32:22,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:32:22,913 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:22" (1/1) ... [2024-11-09 00:32:22,913 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:22" (1/1) ... [2024-11-09 00:32:22,915 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:22" (1/1) ... [2024-11-09 00:32:22,946 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:22,946 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:22" (1/1) ... [2024-11-09 00:32:22,947 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:22" (1/1) ... [2024-11-09 00:32:22,957 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:22" (1/1) ... [2024-11-09 00:32:22,961 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:22" (1/1) ... [2024-11-09 00:32:22,962 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:22" (1/1) ... [2024-11-09 00:32:22,964 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:22" (1/1) ... [2024-11-09 00:32:22,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:32:22,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:32:22,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:32:22,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:32:22,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:22,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:32:23,011 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:23,019 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:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:32:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:32:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:32:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:32:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:32:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:32:23,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:32:23,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:32:23,339 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:32:23,340 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:32:23,360 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:32:23,360 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:32:23,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:23 BoogieIcfgContainer [2024-11-09 00:32:23,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:32:23,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:32:23,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:32:23,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:32:23,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:22" (1/3) ... [2024-11-09 00:32:23,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bef705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:23, skipping insertion in model container [2024-11-09 00:32:23,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (2/3) ... [2024-11-09 00:32:23,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bef705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:23, skipping insertion in model container [2024-11-09 00:32:23,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:23" (3/3) ... [2024-11-09 00:32:23,383 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2024-11-09 00:32:23,409 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:32:23,410 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:32:23,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:32:23,498 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;@1550f4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:32:23,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:32:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:32:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:32:23,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:23,514 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:32:23,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:23,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2122992069, now seen corresponding path program 1 times [2024-11-09 00:32:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:32:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983382460] [2024-11-09 00:32:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:23,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:32:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:32:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:32:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:32:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:32:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:32:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:32:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:32:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:32:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:32:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:32:23,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:32:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983382460] [2024-11-09 00:32:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983382460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:23,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:23,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:32:23,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830550851] [2024-11-09 00:32:23,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:23,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:32:23,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:32:23,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:32:23,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:23,930 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 00:32:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:23,952 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2024-11-09 00:32:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:32:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2024-11-09 00:32:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:23,961 INFO L225 Difference]: With dead ends: 67 [2024-11-09 00:32:23,962 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 00:32:23,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:23,969 INFO L432 NwaCegarLoop]: 43 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, 43 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:23,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 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:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 00:32:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 00:32:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:32:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-09 00:32:24,011 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 67 [2024-11-09 00:32:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:24,013 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-09 00:32:24,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 00:32:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-09 00:32:24,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:32:24,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:24,016 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:32:24,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:32:24,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:24,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2083048059, now seen corresponding path program 1 times [2024-11-09 00:32:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:32:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441123685] [2024-11-09 00:32:24,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:24,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:32:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:24,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:32:24,337 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:32:24,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:32:24,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:32:24,345 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:32:24,415 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:32:24,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:32:24 BoogieIcfgContainer [2024-11-09 00:32:24,419 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:32:24,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:32:24,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:32:24,420 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:32:24,421 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:23" (3/4) ... [2024-11-09 00:32:24,424 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:32:24,425 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:32:24,426 INFO L158 Benchmark]: Toolchain (without parser) took 1831.58ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 96.4MB in the beginning and 188.4MB in the end (delta: -92.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:24,426 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:24,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.78ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 137.5MB in the end (delta: -41.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:32:24,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.98ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 135.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:32:24,429 INFO L158 Benchmark]: Boogie Preprocessor took 65.12ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 135.6MB in the beginning and 202.1MB in the end (delta: -66.5MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-11-09 00:32:24,430 INFO L158 Benchmark]: RCFGBuilder took 394.13ms. Allocated memory is still 230.7MB. Free memory was 202.1MB in the beginning and 187.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:32:24,430 INFO L158 Benchmark]: TraceAbstraction took 1054.56ms. Allocated memory is still 230.7MB. Free memory was 186.4MB in the beginning and 189.4MB in the end (delta: -3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:24,432 INFO L158 Benchmark]: Witness Printer took 5.84ms. Allocated memory is still 230.7MB. Free memory was 189.4MB in the beginning and 188.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:24,434 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.13ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.78ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 137.5MB in the end (delta: -41.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.98ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 135.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.12ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 135.6MB in the beginning and 202.1MB in the end (delta: -66.5MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * RCFGBuilder took 394.13ms. Allocated memory is still 230.7MB. Free memory was 202.1MB in the beginning and 187.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1054.56ms. Allocated memory is still 230.7MB. Free memory was 186.4MB in the beginning and 189.4MB in the end (delta: -3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.84ms. Allocated memory is still 230.7MB. Free memory was 189.4MB in the beginning and 188.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] double var_1_2 = 24.75; [L24] double var_1_3 = 16.7; [L25] double var_1_4 = 0.8; [L26] signed short int var_1_5 = -1; [L27] signed short int var_1_6 = 4; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; VAL [isInitial=0, var_1_1=-1, var_1_2=99/4, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] 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=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L42] 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=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L43] var_1_3 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L44] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L46] var_1_4 = __VERIFIER_nondet_double() [L47] 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=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L47] 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=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L48] var_1_5 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L49] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L51] var_1_6 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_6 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L52] RET assume_abort_if_not(var_1_6 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L53] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L53] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=1] [L54] var_1_8 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L55] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L56] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L56] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L69] RET updateVariables() [L70] CALL step() [L33] COND TRUE (var_1_2 + (15.3 / var_1_3)) > (- var_1_4) [L34] var_1_1 = (var_1_5 + var_1_6) VAL [isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=0, var_1_8=-255] [L38] var_1_7 = var_1_8 VAL [isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=-255, var_1_8=-255] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return (((var_1_2 + (15.3 / var_1_3)) > (- var_1_4)) ? (var_1_1 == ((signed short int) (var_1_5 + var_1_6))) : (var_1_1 == ((signed short int) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))))) && (var_1_7 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=-255, var_1_8=-255] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=-255, var_1_8=-255] [L19] reach_error() VAL [isInitial=1, var_1_1=9, var_1_5=5, var_1_6=4, var_1_7=-255, var_1_8=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 10, 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, 43 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, 43 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 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.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 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:24,483 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-18.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 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:32:26,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:32:26,684 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:26,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:32:26,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:32:26,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:32:26,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:32:26,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:32:26,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:32:26,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:32:26,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:32:26,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:32:26,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:32:26,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:32:26,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:32:26,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:32:26,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:32:26,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:32:26,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:32:26,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:32:26,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:32:26,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:32:26,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:32:26,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:32:26,736 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:32:26,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:32:26,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:32:26,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:32:26,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:32:26,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:32:26,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:32:26,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:32:26,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:32:26,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:32:26,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:26,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:32:26,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:32:26,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:32:26,739 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:32:26,739 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:32:26,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:32:26,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:32:26,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:32:26,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:32:26,741 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 -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2024-11-09 00:32:27,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:32:27,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:32:27,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:32:27,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:32:27,089 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:32:27,090 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-18.i [2024-11-09 00:32:28,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:32:28,992 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:32:28,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2024-11-09 00:32:29,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708f6050f/4704aebf675a4cd6ad73c160cd00c44c/FLAG5063f0cbb [2024-11-09 00:32:29,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708f6050f/4704aebf675a4cd6ad73c160cd00c44c [2024-11-09 00:32:29,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:32:29,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:32:29,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:29,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:32:29,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:32:29,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:29" (1/1) ... [2024-11-09 00:32:29,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ea8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:29, skipping insertion in model container [2024-11-09 00:32:29,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:29" (1/1) ... [2024-11-09 00:32:29,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:32:29,476 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-18.i[915,928] [2024-11-09 00:32:29,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:29,546 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:32:29,559 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-18.i[915,928] [2024-11-09 00:32:29,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:29,613 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:32:29,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:29 WrapperNode [2024-11-09 00:32:29,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:29,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:29,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:32:29,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:32:29,623 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:29" (1/1) ... [2024-11-09 00:32:29,641 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:29" (1/1) ... [2024-11-09 00:32:29,665 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 74 [2024-11-09 00:32:29,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:29,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:32:29,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:32:29,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:32:29,677 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:29" (1/1) ... [2024-11-09 00:32:29,677 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:29" (1/1) ... [2024-11-09 00:32:29,680 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:29" (1/1) ... [2024-11-09 00:32:29,691 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:29,695 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:29" (1/1) ... [2024-11-09 00:32:29,695 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:29" (1/1) ... [2024-11-09 00:32:29,705 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:29" (1/1) ... [2024-11-09 00:32:29,708 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:29" (1/1) ... [2024-11-09 00:32:29,710 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:29" (1/1) ... [2024-11-09 00:32:29,715 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:29" (1/1) ... [2024-11-09 00:32:29,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:32:29,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:32:29,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:32:29,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:32:29,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:29" (1/1) ... [2024-11-09 00:32:29,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:29,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:32:29,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:29,758 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:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:32:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:32:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:32:29,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:32:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:32:29,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:32:29,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:32:29,895 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:32:42,444 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:32:42,444 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:32:42,456 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:32:42,456 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:32:42,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:42 BoogieIcfgContainer [2024-11-09 00:32:42,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:32:42,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:32:42,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:32:42,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:32:42,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:29" (1/3) ... [2024-11-09 00:32:42,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd65e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:42, skipping insertion in model container [2024-11-09 00:32:42,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:29" (2/3) ... [2024-11-09 00:32:42,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd65e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:42, skipping insertion in model container [2024-11-09 00:32:42,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:42" (3/3) ... [2024-11-09 00:32:42,464 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2024-11-09 00:32:42,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:32:42,481 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:32:42,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:32:42,567 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;@7aa8b72d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:32:42,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:32:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:32:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:32:42,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:42,582 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:32:42,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2122992069, now seen corresponding path program 1 times [2024-11-09 00:32:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511195159] [2024-11-09 00:32:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:42,603 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:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:42,607 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:42,608 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:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:43,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:32:43,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-09 00:32:43,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:32:43,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511195159] [2024-11-09 00:32:43,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511195159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:43,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:43,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:32:43,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459344411] [2024-11-09 00:32:43,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:32:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:43,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:32:43,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:43,597 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:32:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:43,616 INFO L93 Difference]: Finished difference Result 67 states and 104 transitions. [2024-11-09 00:32:43,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:32:43,619 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-09 00:32:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:43,625 INFO L225 Difference]: With dead ends: 67 [2024-11-09 00:32:43,626 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 00:32:43,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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:43,632 INFO L432 NwaCegarLoop]: 43 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, 43 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:43,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 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:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 00:32:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 00:32:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:32:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-09 00:32:43,688 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 67 [2024-11-09 00:32:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-09 00:32:43,689 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), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:32:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-09 00:32:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:32:43,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:43,692 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:32:43,716 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:43,896 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:43,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:43,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2083048059, now seen corresponding path program 1 times [2024-11-09 00:32:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080541199] [2024-11-09 00:32:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:43,900 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:43,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:43,903 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:43,904 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:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:44,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:32:44,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:52,731 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:32:57,503 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from false [2024-11-09 00:33:01,585 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from true [2024-11-09 00:33:09,751 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:33:18,026 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:33:22,849 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_7~0 c_~var_1_8~0) (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from false [2024-11-09 00:33:26,925 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_7~0 c_~var_1_8~0) (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from true [2024-11-09 00:33:39,665 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:33:43,763 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_property_#res#1| (_ bv1 32)) (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (fp.gt (fp.add currentRoundingMode ~var_1_2~0 (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 153.0 10.0)) ~var_1_3~0)) (fp.neg ~var_1_4~0)))) is different from false [2024-11-09 00:33:56,037 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:34:00,117 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (fp.gt (fp.add currentRoundingMode ~var_1_2~0 (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 153.0 10.0)) ~var_1_3~0)) (fp.neg ~var_1_4~0))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2024-11-09 00:34:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:34:00,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:34:00,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:34:00,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080541199] [2024-11-09 00:34:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080541199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:34:00,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:34:00,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:34:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185510064] [2024-11-09 00:34:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:34:00,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:34:00,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:34:00,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:34:00,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=3, Unknown=6, NotChecked=12, Total=30 [2024-11-09 00:34:00,134 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:34:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:34:00,143 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-09 00:34:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:34:00,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2024-11-09 00:34:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:34:00,145 INFO L225 Difference]: With dead ends: 39 [2024-11-09 00:34:00,145 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 00:34:00,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=9, Invalid=3, Unknown=6, NotChecked=12, Total=30 [2024-11-09 00:34:00,146 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:34:00,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 108 Unchecked, 0.0s Time] [2024-11-09 00:34:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 00:34:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 00:34:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:34:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-09 00:34:00,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 67 [2024-11-09 00:34:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:34:00,161 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-09 00:34:00,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:34:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-09 00:34:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 00:34:00,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:34:00,162 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:34:00,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:34:00,363 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:34:00,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:34:00,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:34:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2140306361, now seen corresponding path program 1 times [2024-11-09 00:34:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:34:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576977651] [2024-11-09 00:34:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:34:00,364 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:34:00,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:34:00,371 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:34:00,372 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:34:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:34:01,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:34:01,020 INFO L278 TraceCheckSpWp]: Computing forward predicates...