./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.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 adf480f71c98f97b1e3553d7ccd07596f803ed516785c8ed007d232ae0455bf0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:46:17,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:46:17,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:46:17,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:46:17,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:46:17,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:46:17,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:46:17,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:46:17,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:46:17,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:46:17,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:46:17,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:46:17,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:46:17,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:46:17,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:46:17,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:46:17,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:46:17,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:46:17,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:46:17,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:46:17,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:46:17,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:46:17,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:46:17,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:46:17,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:46:17,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:46:17,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:46:17,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:46:17,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:46:17,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:46:17,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:46:17,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:46:17,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:46:17,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:46:17,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:46:17,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:46:17,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:46:17,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:46:17,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:46:17,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:46:17,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:46:17,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:46:17,886 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 -> adf480f71c98f97b1e3553d7ccd07596f803ed516785c8ed007d232ae0455bf0 [2024-10-14 11:46:18,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:46:18,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:46:18,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:46:18,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:46:18,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:46:18,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i [2024-10-14 11:46:19,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:46:19,538 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:46:19,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i [2024-10-14 11:46:19,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b895af230/01649d9580774e29946e7e74e88eab4e/FLAG1dc618fae [2024-10-14 11:46:19,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b895af230/01649d9580774e29946e7e74e88eab4e [2024-10-14 11:46:19,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:46:19,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:46:19,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:46:19,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:46:19,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:46:19,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4c46be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19, skipping insertion in model container [2024-10-14 11:46:19,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:46:19,696 WARN L248 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_loopvsstraightlinecode_25-while_file-47.i[915,928] [2024-10-14 11:46:19,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:46:19,728 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:46:19,740 WARN L248 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_loopvsstraightlinecode_25-while_file-47.i[915,928] [2024-10-14 11:46:19,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:46:19,779 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:46:19,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19 WrapperNode [2024-10-14 11:46:19,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:46:19,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:46:19,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:46:19,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:46:19,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,824 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-14 11:46:19,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:46:19,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:46:19,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:46:19,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:46:19,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,846 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-10-14 11:46:19,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:46:19,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:46:19,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:46:19,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:46:19,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (1/1) ... [2024-10-14 11:46:19,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:46:19,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:46:19,893 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-10-14 11:46:19,900 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-10-14 11:46:19,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:46:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:46:19,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:46:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:46:19,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:46:19,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:46:20,007 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:46:20,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:46:20,228 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:46:20,228 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:46:20,257 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:46:20,257 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:46:20,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:46:20 BoogieIcfgContainer [2024-10-14 11:46:20,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:46:20,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:46:20,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:46:20,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:46:20,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:46:19" (1/3) ... [2024-10-14 11:46:20,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f478965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:46:20, skipping insertion in model container [2024-10-14 11:46:20,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:19" (2/3) ... [2024-10-14 11:46:20,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f478965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:46:20, skipping insertion in model container [2024-10-14 11:46:20,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:46:20" (3/3) ... [2024-10-14 11:46:20,267 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-47.i [2024-10-14 11:46:20,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:46:20,282 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:46:20,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:46:20,333 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;@4d55b9ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:46:20,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:46:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 11:46:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 11:46:20,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:20,344 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] [2024-10-14 11:46:20,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:20,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2066073024, now seen corresponding path program 1 times [2024-10-14 11:46:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075156007] [2024-10-14 11:46:20,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:46:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:46:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:46:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:46:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:46:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 11:46:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 11:46:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 11:46:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 11:46:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:46:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 11:46:20,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:46:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075156007] [2024-10-14 11:46:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075156007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:20,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:46:20,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168212096] [2024-10-14 11:46:20,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:20,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:46:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:46:20,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:46:20,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:46:20,605 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (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-10-14 11:46:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:20,633 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2024-10-14 11:46:20,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:46:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (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 65 [2024-10-14 11:46:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:20,640 INFO L225 Difference]: With dead ends: 67 [2024-10-14 11:46:20,640 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 11:46:20,643 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-10-14 11:46:20,646 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:20,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:46:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 11:46:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-14 11:46:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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-10-14 11:46:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-10-14 11:46:20,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 65 [2024-10-14 11:46:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:20,680 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-10-14 11:46:20,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (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-10-14 11:46:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-10-14 11:46:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 11:46:20,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:20,683 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] [2024-10-14 11:46:20,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:46:20,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -62286396, now seen corresponding path program 1 times [2024-10-14 11:46:20,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:46:20,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134641740] [2024-10-14 11:46:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:46:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:46:20,811 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:46:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:46:20,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:46:20,930 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:46:20,932 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:46:20,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:46:20,936 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 11:46:20,994 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:46:20,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:46:20 BoogieIcfgContainer [2024-10-14 11:46:20,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:46:21,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:46:21,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:46:21,000 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:46:21,000 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:46:20" (3/4) ... [2024-10-14 11:46:21,002 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:46:21,003 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:46:21,004 INFO L158 Benchmark]: Toolchain (without parser) took 1440.21ms. Allocated memory is still 165.7MB. Free memory was 133.0MB in the beginning and 71.5MB in the end (delta: 61.5MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,005 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:46:21,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.45ms. Allocated memory is still 165.7MB. Free memory was 133.0MB in the beginning and 119.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.81ms. Allocated memory is still 165.7MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,008 INFO L158 Benchmark]: Boogie Preprocessor took 35.40ms. Allocated memory is still 165.7MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,009 INFO L158 Benchmark]: RCFGBuilder took 395.90ms. Allocated memory is still 165.7MB. Free memory was 115.8MB in the beginning and 126.0MB in the end (delta: -10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,009 INFO L158 Benchmark]: TraceAbstraction took 739.87ms. Allocated memory is still 165.7MB. Free memory was 125.2MB in the beginning and 71.9MB in the end (delta: 53.3MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-14 11:46:21,009 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 165.7MB. Free memory was 71.9MB in the beginning and 71.5MB in the end (delta: 420.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:46:21,012 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.14ms. Allocated memory is still 165.7MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.45ms. Allocated memory is still 165.7MB. Free memory was 133.0MB in the beginning and 119.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.81ms. Allocated memory is still 165.7MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.40ms. Allocated memory is still 165.7MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 395.90ms. Allocated memory is still 165.7MB. Free memory was 115.8MB in the beginning and 126.0MB in the end (delta: -10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 739.87ms. Allocated memory is still 165.7MB. Free memory was 125.2MB in the beginning and 71.9MB in the end (delta: 53.3MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 165.7MB. Free memory was 71.9MB in the beginning and 71.5MB in the end (delta: 420.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryFLOAToperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 128.5; [L24] float var_1_9 = -0.5; [L25] float var_1_10 = 200.4; [L26] unsigned long int var_1_11 = 4; [L27] unsigned char var_1_12 = 1; [L28] unsigned long int var_1_13 = 3607105345; [L29] signed char var_1_14 = 0; [L30] signed char var_1_15 = 0; [L31] signed char var_1_16 = 16; [L32] double last_1_var_1_1 = 24.575; [L33] float last_1_var_1_9 = -0.5; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_1 = var_1_1 [L78] last_1_var_1_9 = var_1_9 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L59] var_1_8 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L60] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_10=1002/5, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L61] var_1_10 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L62] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=1, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L63] var_1_12 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L64] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L65] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L65] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=3607105345, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L66] var_1_13 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L67] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L68] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L68] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=0, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L69] var_1_15 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L70] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L71] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L71] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=16, var_1_1=983/40, var_1_9=3607105352] [L72] var_1_16 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L74] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L74] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=0, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L89] RET updateVariables() [L90] CALL step() [L37] COND FALSE !(((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) [L42] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=4, var_1_12=0, var_1_13=2147483806, var_1_14=126, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L44] COND FALSE !(\read(var_1_12)) [L47] var_1_11 = ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=2147483648, var_1_12=0, var_1_13=2147483806, var_1_14=126, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105352] [L49] var_1_9 = ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))))) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=2147483648, var_1_12=0, var_1_13=2147483806, var_1_14=126, var_1_15=126, var_1_16=122, var_1_1=983/40, var_1_9=3607105350] [L50] COND FALSE !(var_1_9 <= var_1_9) [L55] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=2147483648, var_1_12=0, var_1_13=2147483806, var_1_14=126, var_1_15=126, var_1_16=122, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_9 <= var_1_9) ? (((var_1_11 + var_1_11) >= (var_1_14 + var_1_14)) ? (var_1_1 == ((double) var_1_8)) : 1) : (var_1_1 == ((double) var_1_8))) && (var_1_9 == ((float) ((((var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) < 0 ) ? -(var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f)))) : (var_1_10 - ((((10000.4f) < 0 ) ? -(10000.4f) : (10000.4f))))))))) && (var_1_12 ? (var_1_11 == ((unsigned long int) ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))))) : (var_1_11 == ((unsigned long int) ((((var_1_14) > ((var_1_13 - (var_1_14 + 32u)))) ? (var_1_14) : ((var_1_13 - (var_1_14 + 32u))))))))) && ((((((last_1_var_1_9) > (last_1_var_1_9)) ? (last_1_var_1_9) : (last_1_var_1_9))) >= last_1_var_1_1) ? (var_1_12 ? (var_1_14 == ((signed char) (var_1_15 - var_1_16))) : 1) : (var_1_14 == ((signed char) var_1_15))) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=2147483648, var_1_12=0, var_1_13=2147483806, var_1_14=126, var_1_15=126, var_1_16=122, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=983/40, last_1_var_1_9=3607105352, var_1_11=2147483648, var_1_12=0, var_1_13=2147483806, var_1_14=126, var_1_15=126, var_1_16=122, var_1_1=3607105351, var_1_8=3607105351, var_1_9=3607105350] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, 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, 44 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 44 mSDtfsCounter, 3 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=35occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 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-10-14 11:46:21,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.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 adf480f71c98f97b1e3553d7ccd07596f803ed516785c8ed007d232ae0455bf0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:46:23,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:46:23,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:46:23,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:46:23,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:46:23,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:46:23,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:46:23,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:46:23,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:46:23,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:46:23,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:46:23,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:46:23,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:46:23,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:46:23,152 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:46:23,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:46:23,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:46:23,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:46:23,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:46:23,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:46:23,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:46:23,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:46:23,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:46:23,158 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:46:23,158 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:46:23,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:46:23,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:46:23,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:46:23,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:46:23,159 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:46:23,159 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:46:23,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:46:23,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:46:23,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:46:23,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:46:23,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:46:23,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:46:23,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:46:23,161 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:46:23,161 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:46:23,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:46:23,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:46:23,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:46:23,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:46:23,164 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:46:23,172 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 -> adf480f71c98f97b1e3553d7ccd07596f803ed516785c8ed007d232ae0455bf0 [2024-10-14 11:46:23,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:46:23,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:46:23,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:46:23,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:46:23,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:46:23,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i [2024-10-14 11:46:24,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:46:24,957 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:46:24,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-47.i [2024-10-14 11:46:24,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6c9980c/989cf0beb7034253a3e6cc45264f01d0/FLAG900b248c0 [2024-10-14 11:46:24,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae6c9980c/989cf0beb7034253a3e6cc45264f01d0 [2024-10-14 11:46:24,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:46:24,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:46:24,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:46:24,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:46:24,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:46:24,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:46:24" (1/1) ... [2024-10-14 11:46:24,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382d7925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:24, skipping insertion in model container [2024-10-14 11:46:24,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:46:24" (1/1) ... [2024-10-14 11:46:25,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:46:25,158 WARN L248 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_loopvsstraightlinecode_25-while_file-47.i[915,928] [2024-10-14 11:46:25,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:46:25,223 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:46:25,242 WARN L248 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_loopvsstraightlinecode_25-while_file-47.i[915,928] [2024-10-14 11:46:25,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:46:25,281 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:46:25,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25 WrapperNode [2024-10-14 11:46:25,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:46:25,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:46:25,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:46:25,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:46:25,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,325 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-14 11:46:25,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:46:25,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:46:25,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:46:25,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:46:25,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,355 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-10-14 11:46:25,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:46:25,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:46:25,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:46:25,381 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:46:25,382 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (1/1) ... [2024-10-14 11:46:25,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:46:25,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:46:25,415 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-10-14 11:46:25,423 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-10-14 11:46:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:46:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:46:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:46:25,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:46:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:46:25,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:46:25,521 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:46:25,523 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:46:25,989 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 11:46:25,989 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:46:26,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:46:26,051 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:46:26,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:46:26 BoogieIcfgContainer [2024-10-14 11:46:26,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:46:26,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:46:26,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:46:26,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:46:26,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:46:24" (1/3) ... [2024-10-14 11:46:26,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571324ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:46:26, skipping insertion in model container [2024-10-14 11:46:26,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:46:25" (2/3) ... [2024-10-14 11:46:26,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571324ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:46:26, skipping insertion in model container [2024-10-14 11:46:26,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:46:26" (3/3) ... [2024-10-14 11:46:26,061 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-47.i [2024-10-14 11:46:26,073 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:46:26,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:46:26,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:46:26,131 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;@18d8bbb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:46:26,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:46:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 11:46:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 11:46:26,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:26,145 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] [2024-10-14 11:46:26,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:26,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2066073024, now seen corresponding path program 1 times [2024-10-14 11:46:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:46:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114350118] [2024-10-14 11:46:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:26,165 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-10-14 11:46:26,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:46:26,167 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-10-14 11:46:26,170 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-10-14 11:46:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:26,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:46:26,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:46:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-14 11:46:26,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:46:26,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:46:26,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114350118] [2024-10-14 11:46:26,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114350118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:46:26,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:46:26,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:46:26,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431080838] [2024-10-14 11:46:26,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:46:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:46:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:46:26,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:46:26,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:46:26,394 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 11:46:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:46:26,523 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2024-10-14 11:46:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:46:26,530 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), 2 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 65 [2024-10-14 11:46:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:46:26,535 INFO L225 Difference]: With dead ends: 67 [2024-10-14 11:46:26,535 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 11:46:26,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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-10-14 11:46:26,540 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:46:26,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:46:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 11:46:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-14 11:46:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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-10-14 11:46:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2024-10-14 11:46:26,579 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 65 [2024-10-14 11:46:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:46:26,579 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2024-10-14 11:46:26,579 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), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 11:46:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2024-10-14 11:46:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 11:46:26,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:46:26,581 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] [2024-10-14 11:46:26,588 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-10-14 11:46:26,782 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-10-14 11:46:26,782 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:46:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:46:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash -62286396, now seen corresponding path program 1 times [2024-10-14 11:46:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:46:26,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854124733] [2024-10-14 11:46:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:46:26,785 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-10-14 11:46:26,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:46:26,787 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-10-14 11:46:26,788 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-10-14 11:46:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:46:26,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 11:46:26,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:46:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 43 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-14 11:46:30,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:46:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-14 11:46:36,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:46:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854124733] [2024-10-14 11:46:36,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854124733] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:46:36,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 11:46:36,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 11:46:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084717422] [2024-10-14 11:46:36,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 11:46:36,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 11:46:36,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:46:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 11:46:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:46:36,554 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-14 11:46:37,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:46:54,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 11:46:59,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 11:47:05,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 11:47:08,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 11:47:09,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 11:47:12,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 11:47:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:47:14,967 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2024-10-14 11:47:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 11:47:14,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 65 [2024-10-14 11:47:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:47:14,979 INFO L225 Difference]: With dead ends: 102 [2024-10-14 11:47:14,979 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 11:47:14,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-10-14 11:47:14,981 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 69 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:47:14,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 120 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2024-10-14 11:47:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 11:47:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 37. [2024-10-14 11:47:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 11:47:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2024-10-14 11:47:14,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 65 [2024-10-14 11:47:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:47:14,995 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2024-10-14 11:47:14,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-14 11:47:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2024-10-14 11:47:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 11:47:14,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:47:14,996 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] [2024-10-14 11:47:15,004 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-10-14 11:47:15,197 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-10-14 11:47:15,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:47:15,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:47:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1939978937, now seen corresponding path program 1 times [2024-10-14 11:47:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:47:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868668313] [2024-10-14 11:47:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:47:15,199 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-10-14 11:47:15,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:47:15,201 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-10-14 11:47:15,203 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-10-14 11:47:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:47:15,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 11:47:15,333 INFO L278 TraceCheckSpWp]: Computing forward predicates...