./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:56:40,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:56:40,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:56:40,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:56:40,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:56:40,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:56:40,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:56:40,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:56:40,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:56:40,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:56:40,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:56:40,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:56:40,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:56:40,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:56:40,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:56:40,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:56:40,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:56:40,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:56:40,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:56:40,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:56:40,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:56:40,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:56:40,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:56:40,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:56:40,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:56:40,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:56:40,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:56:40,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:56:40,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:56:40,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:56:40,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:56:40,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:56:40,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:56:40,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:56:40,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:56:40,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:56:40,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:56:40,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:56:40,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:56:40,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:56:40,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:56:40,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:56:40,666 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-clean/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-clean/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 -> fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 [2024-10-11 10:56:40,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:56:40,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:56:40,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:56:40,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:56:40,996 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:56:40,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2024-10-11 10:56:42,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:56:42,714 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:56:42,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2024-10-11 10:56:42,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1bdf089d/8bbfbb263a384256a89d9cd48ba59465/FLAGf9ddaa3ed [2024-10-11 10:56:42,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1bdf089d/8bbfbb263a384256a89d9cd48ba59465 [2024-10-11 10:56:42,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:56:42,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:56:42,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:56:42,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:56:42,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:56:42,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:56:42" (1/1) ... [2024-10-11 10:56:42,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410b8e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:42, skipping insertion in model container [2024-10-11 10:56:42,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:56:42" (1/1) ... [2024-10-11 10:56:42,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:56:42,981 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i[916,929] [2024-10-11 10:56:43,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:56:43,060 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:56:43,073 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i[916,929] [2024-10-11 10:56:43,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:56:43,129 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:56:43,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43 WrapperNode [2024-10-11 10:56:43,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:56:43,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:56:43,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:56:43,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:56:43,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,190 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-11 10:56:43,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:56:43,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:56:43,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:56:43,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:56:43,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,238 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:56:43,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:56:43,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:56:43,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:56:43,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:56:43,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (1/1) ... [2024-10-11 10:56:43,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:56:43,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:56:43,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:56:43,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:56:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:56:43,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:56:43,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:56:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:56:43,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:56:43,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:56:43,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:56:43,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:56:43,738 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 10:56:43,739 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:56:43,792 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:56:43,793 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:56:43,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:56:43 BoogieIcfgContainer [2024-10-11 10:56:43,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:56:43,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:56:43,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:56:43,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:56:43,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:56:42" (1/3) ... [2024-10-11 10:56:43,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c96959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:56:43, skipping insertion in model container [2024-10-11 10:56:43,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:43" (2/3) ... [2024-10-11 10:56:43,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c96959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:56:43, skipping insertion in model container [2024-10-11 10:56:43,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:56:43" (3/3) ... [2024-10-11 10:56:43,811 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-49.i [2024-10-11 10:56:43,830 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:56:43,831 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:56:43,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:56:43,905 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;@6b726786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:56:43,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:56:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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-10-11 10:56:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 10:56:43,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:56:43,930 INFO L215 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] [2024-10-11 10:56:43,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:56:43,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:56:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2117240908, now seen corresponding path program 1 times [2024-10-11 10:56:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:56:43,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277171590] [2024-10-11 10:56:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:56:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:56:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:56:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:56:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:56:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:56:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:56:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:56:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:56:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:56:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:56:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:56:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:56:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:56:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:56:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:56:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:56:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:56:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:56:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277171590] [2024-10-11 10:56:44,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277171590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:56:44,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:56:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:56:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214024904] [2024-10-11 10:56:44,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:56:44,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:56:44,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:56:44,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:56:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:56:44,475 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-10-11 10:56:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:56:44,507 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2024-10-11 10:56:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:56:44,512 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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 99 [2024-10-11 10:56:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:56:44,523 INFO L225 Difference]: With dead ends: 97 [2024-10-11 10:56:44,523 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 10:56:44,528 INFO L431 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-10-11 10:56:44,533 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:56:44,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:56:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 10:56:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 10:56:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 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-10-11 10:56:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-10-11 10:56:44,586 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 99 [2024-10-11 10:56:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:56:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-10-11 10:56:44,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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-10-11 10:56:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-10-11 10:56:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 10:56:44,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:56:44,593 INFO L215 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] [2024-10-11 10:56:44,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:56:44,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:56:44,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:56:44,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1105483700, now seen corresponding path program 1 times [2024-10-11 10:56:44,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:56:44,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700161837] [2024-10-11 10:56:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:56:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:56:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:56:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:56:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:56:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:56:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:56:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:56:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:56:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:56:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:56:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:56:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:56:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:56:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:56:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:56:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:56:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 10:56:45,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:56:45,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700161837] [2024-10-11 10:56:45,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700161837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:56:45,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:56:45,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:56:45,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595509294] [2024-10-11 10:56:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:56:45,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:56:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:56:45,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:56:45,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:56:45,122 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:56:45,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:56:45,353 INFO L93 Difference]: Finished difference Result 103 states and 150 transitions. [2024-10-11 10:56:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:56:45,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-11 10:56:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:56:45,356 INFO L225 Difference]: With dead ends: 103 [2024-10-11 10:56:45,357 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 10:56:45,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:56:45,359 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:56:45,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 111 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:56:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 10:56:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-10-11 10:56:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:56:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-11 10:56:45,381 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 99 [2024-10-11 10:56:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:56:45,381 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-11 10:56:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:56:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-10-11 10:56:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 10:56:45,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:56:45,389 INFO L215 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] [2024-10-11 10:56:45,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:56:45,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:56:45,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:56:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash 731228669, now seen corresponding path program 1 times [2024-10-11 10:56:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:56:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712108040] [2024-10-11 10:56:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:56:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:56:45,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:56:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:56:45,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:56:45,607 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:56:45,609 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:56:45,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:56:45,615 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:56:45,686 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:56:45,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:56:45 BoogieIcfgContainer [2024-10-11 10:56:45,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:56:45,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:56:45,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:56:45,691 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:56:45,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:56:43" (3/4) ... [2024-10-11 10:56:45,694 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:56:45,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:56:45,696 INFO L158 Benchmark]: Toolchain (without parser) took 2921.76ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 154.8MB in the beginning and 181.8MB in the end (delta: -27.0MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-11 10:56:45,697 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:56:45,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.31ms. Allocated memory is still 184.5MB. Free memory was 154.6MB in the beginning and 144.2MB in the end (delta: 10.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-10-11 10:56:45,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.08ms. Allocated memory is still 184.5MB. Free memory was 144.2MB in the beginning and 140.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:56:45,698 INFO L158 Benchmark]: Boogie Preprocessor took 78.54ms. Allocated memory is still 184.5MB. Free memory was 140.0MB in the beginning and 132.4MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 10:56:45,699 INFO L158 Benchmark]: RCFGBuilder took 522.50ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 109.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 10:56:45,699 INFO L158 Benchmark]: TraceAbstraction took 1892.23ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 109.4MB in the beginning and 182.9MB in the end (delta: -73.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:56:45,700 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 228.6MB. Free memory is still 181.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:56:45,705 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.17ms. Allocated memory is still 130.0MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.31ms. Allocated memory is still 184.5MB. Free memory was 154.6MB in the beginning and 144.2MB in the end (delta: 10.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.08ms. Allocated memory is still 184.5MB. Free memory was 144.2MB in the beginning and 140.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.54ms. Allocated memory is still 184.5MB. Free memory was 140.0MB in the beginning and 132.4MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 522.50ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 109.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1892.23ms. Allocated memory was 184.5MB in the beginning and 228.6MB in the end (delta: 44.0MB). Free memory was 109.4MB in the beginning and 182.9MB in the end (delta: -73.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 228.6MB. Free memory is still 181.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] signed long int var_1_2 = 1000000000; [L24] signed long int var_1_3 = 1000; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 4; [L27] unsigned short int var_1_6 = 10; [L28] signed short int var_1_8 = 128; [L29] signed short int var_1_9 = -2; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 1; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L66] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L67] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=1000, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L68] var_1_3 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L69] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L70] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=256, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L73] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=10, var_1_8=128, var_1_9=-2] [L74] var_1_5 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_6=10, var_1_8=128, var_1_9=-2] [L76] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L76] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=10, var_1_8=128, var_1_9=-2] [L77] var_1_6 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L78] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_8=128, var_1_9=-2] [L79] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=-2] [L79] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=-2] [L80] var_1_9 = __VERIFIER_nondet_short() [L81] CALL assume_abort_if_not(var_1_9 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L81] RET assume_abort_if_not(var_1_9 >= -32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L82] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L82] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L85] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L85] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L86] var_1_12 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L87] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L88] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L88] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=128, var_1_9=32766] [L101] RET updateVariables() [L102] CALL step() [L37] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L38] EXPR 50 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L38] COND TRUE (50 >> var_1_4) <= var_1_8 [L39] var_1_10 = ((! (! var_1_11)) || var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L43] COND TRUE ! var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L44] COND TRUE var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) [L45] var_1_13 = (var_1_10 && var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=4, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L50] COND FALSE !(var_1_2 >= 64.5f) [L61] var_1_1 = 50 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11)))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L93-L94] return ((((var_1_2 >= 64.5f) ? ((var_1_2 >= var_1_3) ? (var_1_1 == ((unsigned short int) (((((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) < 0 ) ? -((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) : ((((var_1_4) > (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) ? (var_1_4) : (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))))))) : (var_1_13 ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) var_1_6)))) : (var_1_1 == ((unsigned short int) 50))) && (var_1_8 == ((signed short int) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && (((50 >> var_1_4) <= var_1_8) ? (var_1_10 == ((unsigned char) ((! (! var_1_11)) || var_1_12))) : (var_1_10 == ((unsigned char) (! var_1_11))))) && ((! var_1_12) ? ((var_1_4 >= ((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8)))) ? (var_1_13 == ((unsigned char) (var_1_10 && var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : 1) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_1=50, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=65534, var_1_6=0, var_1_8=32766, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 117 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 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-10-11 10:56:45,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:56:48,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:56:48,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:56:48,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:56:48,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:56:48,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:56:48,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:56:48,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:56:48,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:56:48,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:56:48,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:56:48,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:56:48,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:56:48,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:56:48,161 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:56:48,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:56:48,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:56:48,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:56:48,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:56:48,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:56:48,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:56:48,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:56:48,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:56:48,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:56:48,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:56:48,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:56:48,166 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:56:48,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:56:48,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:56:48,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:56:48,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:56:48,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:56:48,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:56:48,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:56:48,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:56:48,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:56:48,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:56:48,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:56:48,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:56:48,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:56:48,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:56:48,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:56:48,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:56:48,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:56:48,173 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:56:48,174 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-clean/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-clean/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 -> fbb94f92326360d1b49e2127744a54ce104befba5614aa9d887afe6ba1b1edd0 [2024-10-11 10:56:48,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:56:48,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:56:48,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:56:48,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:56:48,556 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:56:48,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2024-10-11 10:56:50,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:56:50,408 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:56:50,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i [2024-10-11 10:56:50,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a4e17804/cfcadeca347a4af791161a811ac7dc57/FLAGdf2cd26db [2024-10-11 10:56:50,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a4e17804/cfcadeca347a4af791161a811ac7dc57 [2024-10-11 10:56:50,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:56:50,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:56:50,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:56:50,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:56:50,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:56:50,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:56:50" (1/1) ... [2024-10-11 10:56:50,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9063806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:50, skipping insertion in model container [2024-10-11 10:56:50,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:56:50" (1/1) ... [2024-10-11 10:56:50,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:56:50,982 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i[916,929] [2024-10-11 10:56:51,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:56:51,067 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:56:51,081 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-49.i[916,929] [2024-10-11 10:56:51,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:56:51,123 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:56:51,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51 WrapperNode [2024-10-11 10:56:51,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:56:51,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:56:51,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:56:51,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:56:51,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,179 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-11 10:56:51,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:56:51,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:56:51,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:56:51,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:56:51,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,226 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:56:51,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:56:51,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:56:51,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:56:51,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:56:51,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (1/1) ... [2024-10-11 10:56:51,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:56:51,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:56:51,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:56:51,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:56:51,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:56:51,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:56:51,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:56:51,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:56:51,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:56:51,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:56:51,406 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:56:51,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:56:52,145 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 10:56:52,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:56:52,215 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:56:52,217 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:56:52,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:56:52 BoogieIcfgContainer [2024-10-11 10:56:52,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:56:52,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:56:52,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:56:52,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:56:52,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:56:50" (1/3) ... [2024-10-11 10:56:52,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2fe83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:56:52, skipping insertion in model container [2024-10-11 10:56:52,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:56:51" (2/3) ... [2024-10-11 10:56:52,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2fe83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:56:52, skipping insertion in model container [2024-10-11 10:56:52,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:56:52" (3/3) ... [2024-10-11 10:56:52,229 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-49.i [2024-10-11 10:56:52,245 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:56:52,245 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:56:52,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:56:52,322 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;@55f3a2d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:56:52,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:56:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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-10-11 10:56:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 10:56:52,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:56:52,338 INFO L215 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] [2024-10-11 10:56:52,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:56:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:56:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash 297792991, now seen corresponding path program 1 times [2024-10-11 10:56:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:56:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638826694] [2024-10-11 10:56:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:56:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:56:52,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:56:52,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:56:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:52,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:56:52,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:56:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-11 10:56:52,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:56:52,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:56:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638826694] [2024-10-11 10:56:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638826694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:56:52,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:56:52,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:56:52,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791357782] [2024-10-11 10:56:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:56:52,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:56:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:56:52,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:56:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:56:52,626 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:56:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:56:52,767 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2024-10-11 10:56:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:56:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2024-10-11 10:56:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:56:52,787 INFO L225 Difference]: With dead ends: 83 [2024-10-11 10:56:52,787 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 10:56:52,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:56:52,794 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:56:52,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:56:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 10:56:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 10:56:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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-10-11 10:56:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 62 transitions. [2024-10-11 10:56:52,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 62 transitions. Word has length 96 [2024-10-11 10:56:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:56:52,843 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 62 transitions. [2024-10-11 10:56:52,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:56:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 62 transitions. [2024-10-11 10:56:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 10:56:52,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:56:52,850 INFO L215 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] [2024-10-11 10:56:52,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:56:53,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:56:53,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:56:53,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:56:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1005251105, now seen corresponding path program 1 times [2024-10-11 10:56:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:56:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830346624] [2024-10-11 10:56:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:56:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:56:53,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:56:53,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:56:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:53,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:56:53,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:56:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-11 10:56:53,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:56:53,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:56:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830346624] [2024-10-11 10:56:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830346624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:56:53,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:56:53,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:56:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733727203] [2024-10-11 10:56:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:56:53,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:56:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:56:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:56:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:56:53,316 INFO L87 Difference]: Start difference. First operand 41 states and 62 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:56:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:56:53,706 INFO L93 Difference]: Finished difference Result 89 states and 130 transitions. [2024-10-11 10:56:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:56:53,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 96 [2024-10-11 10:56:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:56:53,719 INFO L225 Difference]: With dead ends: 89 [2024-10-11 10:56:53,719 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 10:56:53,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:56:53,722 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:56:53,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:56:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 10:56:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2024-10-11 10:56:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:56:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-10-11 10:56:53,740 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 96 [2024-10-11 10:56:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:56:53,741 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-10-11 10:56:53,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:56:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-10-11 10:56:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 10:56:53,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:56:53,743 INFO L215 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] [2024-10-11 10:56:53,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:56:53,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:56:53,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:56:53,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:56:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1349302169, now seen corresponding path program 1 times [2024-10-11 10:56:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:56:53,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548924316] [2024-10-11 10:56:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:56:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:56:53,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:56:53,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:56:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:54,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 10:56:54,097 INFO L278 TraceCheckSpWp]: Computing forward predicates...