./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.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 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:44:41,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:44:41,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:44:41,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:44:41,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:44:41,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:44:41,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:44:41,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:44:41,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:44:41,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:44:41,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:44:41,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:44:41,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:44:41,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:44:41,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:44:41,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:44:41,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:44:41,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:44:41,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:44:41,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:44:41,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:44:41,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:44:41,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:44:41,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:44:41,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:44:41,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:44:41,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:44:41,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:44:41,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:44:41,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:44:41,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:44:41,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:44:41,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:44:41,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:44:41,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:44:41,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:44:41,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:44:41,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:44:41,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:44:41,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:44:41,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:44:41,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:44:41,170 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 -> 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 [2024-11-12 04:44:41,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:44:41,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:44:41,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:44:41,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:44:41,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:44:41,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i [2024-11-12 04:44:42,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:44:43,208 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:44:43,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i [2024-11-12 04:44:43,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880c02d02/ce089b5ee53b4f20b8f1a0ff92b1654b/FLAGb6bf9c416 [2024-11-12 04:44:43,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/880c02d02/ce089b5ee53b4f20b8f1a0ff92b1654b [2024-11-12 04:44:43,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:44:43,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:44:43,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:44:43,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:44:43,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:44:43,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86f4527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43, skipping insertion in model container [2024-11-12 04:44:43,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:44:43,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i[917,930] [2024-11-12 04:44:43,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:44:43,581 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:44:43,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i[917,930] [2024-11-12 04:44:43,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:44:43,654 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:44:43,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43 WrapperNode [2024-11-12 04:44:43,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:44:43,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:44:43,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:44:43,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:44:43,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,723 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-12 04:44:43,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:44:43,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:44:43,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:44:43,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:44:43,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:44:43,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:44:43,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:44:43,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:44:43,796 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:44:43,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (1/1) ... [2024-11-12 04:44:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:44:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:44:43,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:44:43,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:44:43,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:44:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:44:43,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:44:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:44:43,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:44:43,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:44:43,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:44:43,998 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:44:44,331 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:44:44,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:44:44,357 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:44:44,359 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:44:44,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:44:44 BoogieIcfgContainer [2024-11-12 04:44:44,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:44:44,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:44:44,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:44:44,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:44:44,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:44:43" (1/3) ... [2024-11-12 04:44:44,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bdc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:44:44, skipping insertion in model container [2024-11-12 04:44:44,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:43" (2/3) ... [2024-11-12 04:44:44,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76bdc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:44:44, skipping insertion in model container [2024-11-12 04:44:44,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:44:44" (3/3) ... [2024-11-12 04:44:44,371 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-96.i [2024-11-12 04:44:44,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:44:44,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:44:44,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:44:44,474 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;@390d26e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:44:44,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:44:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 04:44:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 04:44:44,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:44,493 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:44,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash -848629421, now seen corresponding path program 1 times [2024-11-12 04:44:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:44,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387577166] [2024-11-12 04:44:44,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:44:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:44:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:44:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:44:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:44:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:44:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:44:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:44:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:44:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 04:44:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387577166] [2024-11-12 04:44:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387577166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:44:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121972588] [2024-11-12 04:44:44,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:44,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:44:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:44:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:44:44,906 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 04:44:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:44,934 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-12 04:44:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:44:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-12 04:44:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:44,945 INFO L225 Difference]: With dead ends: 97 [2024-11-12 04:44:44,946 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 04:44:44,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:44:44,955 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:44,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:44:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 04:44:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 04:44:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 04:44:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-12 04:44:45,034 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2024-11-12 04:44:45,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:45,034 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-12 04:44:45,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 04:44:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-12 04:44:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 04:44:45,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:45,063 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:45,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:44:45,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 116133775, now seen corresponding path program 1 times [2024-11-12 04:44:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:45,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927198389] [2024-11-12 04:44:45,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:44:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:44:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:44:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:44:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:44:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:44:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:44:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 04:44:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:44:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 04:44:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:45,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927198389] [2024-11-12 04:44:45,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927198389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:45,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:45,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:44:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858881920] [2024-11-12 04:44:45,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:45,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:44:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:44:45,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:44:45,640 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 04:44:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:45,804 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2024-11-12 04:44:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:44:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-11-12 04:44:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:45,809 INFO L225 Difference]: With dead ends: 148 [2024-11-12 04:44:45,809 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 04:44:45,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:44:45,811 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:45,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 186 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:44:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 04:44:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-11-12 04:44:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 04:44:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-11-12 04:44:45,839 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 103 [2024-11-12 04:44:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:45,840 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-11-12 04:44:45,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 04:44:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-11-12 04:44:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 04:44:45,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:45,842 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:45,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:44:45,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:45,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 796192145, now seen corresponding path program 1 times [2024-11-12 04:44:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:45,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817069108] [2024-11-12 04:44:45,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:44:45,974 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:44:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:44:46,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:44:46,124 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:44:46,125 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:44:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:44:46,131 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 04:44:46,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:44:46,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:44:46 BoogieIcfgContainer [2024-11-12 04:44:46,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:44:46,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:44:46,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:44:46,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:44:46,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:44:44" (3/4) ... [2024-11-12 04:44:46,241 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:44:46,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:44:46,243 INFO L158 Benchmark]: Toolchain (without parser) took 3001.82ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 67.7MB in the beginning and 136.6MB in the end (delta: -68.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:44:46,243 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:44:46,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.52ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 67.4MB in the beginning and 141.7MB in the end (delta: -74.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-12 04:44:46,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.27ms. Allocated memory is still 174.1MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:44:46,245 INFO L158 Benchmark]: Boogie Preprocessor took 65.61ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 135.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:44:46,248 INFO L158 Benchmark]: RCFGBuilder took 565.57ms. Allocated memory is still 174.1MB. Free memory was 135.4MB in the beginning and 117.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:44:46,248 INFO L158 Benchmark]: TraceAbstraction took 1875.27ms. Allocated memory is still 174.1MB. Free memory was 116.5MB in the beginning and 136.6MB in the end (delta: -20.1MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-11-12 04:44:46,248 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 174.1MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:44:46,250 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.11ms. Allocated memory is still 138.4MB. Free memory is still 89.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.52ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 67.4MB in the beginning and 141.7MB in the end (delta: -74.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.27ms. Allocated memory is still 174.1MB. Free memory was 141.7MB in the beginning and 139.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.61ms. Allocated memory is still 174.1MB. Free memory was 139.6MB in the beginning and 135.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 565.57ms. Allocated memory is still 174.1MB. Free memory was 135.4MB in the beginning and 117.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1875.27ms. Allocated memory is still 174.1MB. Free memory was 116.5MB in the beginning and 136.6MB in the end (delta: -20.1MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 174.1MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 8; [L25] unsigned short int var_1_4 = 1000; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 0; [L30] double var_1_11 = 4.575; [L31] double var_1_13 = 2.75; [L32] double var_1_14 = 128.5; [L33] signed long int var_1_15 = -1000000000; [L34] float var_1_16 = 99999.25; [L35] signed char var_1_17 = 1; [L36] signed char var_1_18 = 50; [L37] unsigned char last_1_var_1_5 = 1; VAL [isInitial=0, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=8, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L71] var_1_3 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=1000, var_1_5=1, var_1_6=0, var_1_9=0] [L74] var_1_4 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_5=1, var_1_6=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=0, var_1_9=0] [L77] var_1_6 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L79] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=0, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=11/4, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L87] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_14=257/2, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L89] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=50, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L90] var_1_18 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L91] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L92] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=8, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L41] COND FALSE !(! last_1_var_1_5) [L44] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L46] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L47] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_15=-1000000000, var_1_16=399997/4, var_1_17=1, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L56] var_1_15 = var_1_1 [L57] var_1_16 = var_1_13 [L58] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L59] COND FALSE !(((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) VAL [isInitial=1, last_1_var_1_5=1, stepLocal_0=-255, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((((! last_1_var_1_5) ? (var_1_1 == ((unsigned short int) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((unsigned short int) var_1_4))) && (var_1_2 ? ((var_1_6 && ((var_1_3 >= 16) || last_1_var_1_5)) ? (var_1_6 ? (var_1_5 == ((unsigned char) ((var_1_1 < var_1_1) && var_1_9))) : (var_1_5 == ((unsigned char) var_1_10))) : 1) : 1)) && ((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) > var_1_15) ? (((var_1_15 / -5) >= ((var_1_4 + var_1_15) - ((((var_1_1) < (var_1_3)) ? (var_1_1) : (var_1_3))))) ? (var_1_11 == ((double) (var_1_13 + var_1_14))) : (var_1_11 == ((double) var_1_14))) : 1)) && (var_1_15 == ((signed long int) var_1_1))) && (var_1_16 == ((float) var_1_13))) && (var_1_17 == ((signed char) var_1_18)) ; VAL [\result=0, isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=1, var_1_10=1, var_1_11=183/40, var_1_13=100004, var_1_15=65530, var_1_16=100004, var_1_17=126, var_1_18=126, var_1_1=65530, var_1_2=0, var_1_3=15, var_1_4=65530, var_1_5=1, var_1_6=-255, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 133 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:44:46,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.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 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:44:48,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:44:48,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:44:48,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:44:48,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:44:48,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:44:48,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:44:48,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:44:48,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:44:48,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:44:48,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:44:48,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:44:48,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:44:48,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:44:48,759 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:44:48,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:44:48,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:44:48,761 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:44:48,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:44:48,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:44:48,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:44:48,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:44:48,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:44:48,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:44:48,766 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:44:48,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:44:48,766 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:44:48,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:44:48,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:44:48,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:44:48,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:44:48,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:44:48,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:44:48,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:44:48,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:44:48,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:44:48,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:44:48,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:44:48,771 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:44:48,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:44:48,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:44:48,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:44:48,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:44:48,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:44:48,774 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 -> 5874a29868093144df67f3d9c006a000f3592329fa7366a6687deaedd0fc5b25 [2024-11-12 04:44:49,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:44:49,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:44:49,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:44:49,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:44:49,159 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:44:49,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i [2024-11-12 04:44:50,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:44:51,034 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:44:51,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i [2024-11-12 04:44:51,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84be5a8b5/cd5d87ccc0fe497ab6573e94d7e02b7b/FLAGe8e4f1f88 [2024-11-12 04:44:51,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84be5a8b5/cd5d87ccc0fe497ab6573e94d7e02b7b [2024-11-12 04:44:51,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:44:51,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:44:51,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:44:51,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:44:51,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:44:51,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa3314d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51, skipping insertion in model container [2024-11-12 04:44:51,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:44:51,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i[917,930] [2024-11-12 04:44:51,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:44:51,403 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:44:51,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-96.i[917,930] [2024-11-12 04:44:51,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:44:51,471 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:44:51,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51 WrapperNode [2024-11-12 04:44:51,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:44:51,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:44:51,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:44:51,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:44:51,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,529 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-12 04:44:51,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:44:51,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:44:51,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:44:51,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:44:51,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,574 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:44:51,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:44:51,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:44:51,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:44:51,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:44:51,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (1/1) ... [2024-11-12 04:44:51,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:44:51,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:44:51,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:44:51,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:44:51,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:44:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:44:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:44:51,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:44:51,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:44:51,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:44:51,788 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:44:51,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:44:52,598 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 04:44:52,598 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:44:52,618 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:44:52,618 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:44:52,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:44:52 BoogieIcfgContainer [2024-11-12 04:44:52,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:44:52,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:44:52,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:44:52,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:44:52,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:44:51" (1/3) ... [2024-11-12 04:44:52,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7f71d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:44:52, skipping insertion in model container [2024-11-12 04:44:52,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:44:51" (2/3) ... [2024-11-12 04:44:52,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7f71d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:44:52, skipping insertion in model container [2024-11-12 04:44:52,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:44:52" (3/3) ... [2024-11-12 04:44:52,640 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-96.i [2024-11-12 04:44:52,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:44:52,657 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:44:52,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:44:52,740 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;@31b48685, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:44:52,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:44:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 04:44:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 04:44:52,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:52,759 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:52,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:52,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash -848629421, now seen corresponding path program 1 times [2024-11-12 04:44:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:44:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023506609] [2024-11-12 04:44:52,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:52,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:44:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:44:52,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:44:52,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:44:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:53,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:44:53,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:44:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-12 04:44:53,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:44:53,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:44:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023506609] [2024-11-12 04:44:53,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023506609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:53,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:53,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:44:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666134186] [2024-11-12 04:44:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:53,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:44:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:44:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:44:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:44:53,123 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 04:44:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:53,148 INFO L93 Difference]: Finished difference Result 97 states and 162 transitions. [2024-11-12 04:44:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:44:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-12 04:44:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:53,157 INFO L225 Difference]: With dead ends: 97 [2024-11-12 04:44:53,157 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 04:44:53,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:44:53,163 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:53,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:44:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 04:44:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 04:44:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 04:44:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-12 04:44:53,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2024-11-12 04:44:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:53,198 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-12 04:44:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-12 04:44:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-12 04:44:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 04:44:53,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:53,203 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:53,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:44:53,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:44:53,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 116133775, now seen corresponding path program 1 times [2024-11-12 04:44:53,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:44:53,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134838147] [2024-11-12 04:44:53,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:53,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:44:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:44:53,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:44:53,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:44:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:53,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 04:44:53,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:44:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 04:44:54,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:44:54,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:44:54,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134838147] [2024-11-12 04:44:54,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134838147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:54,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:44:54,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780251675] [2024-11-12 04:44:54,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:44:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:44:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:44:54,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:44:54,050 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 04:44:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:54,953 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2024-11-12 04:44:54,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:44:54,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-11-12 04:44:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:54,968 INFO L225 Difference]: With dead ends: 148 [2024-11-12 04:44:54,969 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 04:44:54,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:44:54,971 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:54,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 186 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 04:44:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 04:44:54,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2024-11-12 04:44:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 04:44:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-11-12 04:44:55,003 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 103 [2024-11-12 04:44:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:55,003 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-11-12 04:44:55,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-12 04:44:55,004 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-11-12 04:44:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-12 04:44:55,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:55,006 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:55,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 04:44:55,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:44:55,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:55,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 796192145, now seen corresponding path program 1 times [2024-11-12 04:44:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:44:55,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426518494] [2024-11-12 04:44:55,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:55,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:44:55,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:44:55,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:44:55,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:44:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:55,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 04:44:55,421 INFO L279 TraceCheckSpWp]: Computing forward predicates...