./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 367edc47af4ec003a96fd86b04464a3d0c779fcc885147096dbe680589605201 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:56:27,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:56:28,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:56:28,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:56:28,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:56:28,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:56:28,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:56:28,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:56:28,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:56:28,109 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:56:28,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:56:28,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:56:28,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:56:28,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:56:28,111 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:56:28,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:56:28,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:56:28,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:56:28,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:56:28,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:56:28,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:56:28,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:56:28,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:56:28,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:56:28,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:56:28,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:56:28,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:56:28,115 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:56:28,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:56:28,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:56:28,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:56:28,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:56:28,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:56:28,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:56:28,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:56:28,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:56:28,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:56:28,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:56:28,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:56:28,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:56:28,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:56:28,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:56:28,122 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 367edc47af4ec003a96fd86b04464a3d0c779fcc885147096dbe680589605201 [2024-11-08 22:56:28,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:56:28,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:56:28,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:56:28,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:56:28,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:56:28,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i [2024-11-08 22:56:29,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:56:30,042 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:56:30,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i [2024-11-08 22:56:30,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbac8b068/7c42935a9b6d4eaa8dffff2e2c75962a/FLAG75e5ceb5b [2024-11-08 22:56:30,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbac8b068/7c42935a9b6d4eaa8dffff2e2c75962a [2024-11-08 22:56:30,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:56:30,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:56:30,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:56:30,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:56:30,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:56:30,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f741344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30, skipping insertion in model container [2024-11-08 22:56:30,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:56:30,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i[916,929] [2024-11-08 22:56:30,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:56:30,738 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:56:30,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i[916,929] [2024-11-08 22:56:30,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:56:30,799 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:56:30,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30 WrapperNode [2024-11-08 22:56:30,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:56:30,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:56:30,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:56:30,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:56:30,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,849 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-08 22:56:30,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:56:30,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:56:30,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:56:30,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:56:30,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,888 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:56:30,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:56:30,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:56:30,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:56:30,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:56:30,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (1/1) ... [2024-11-08 22:56:30,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:56:30,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:56:30,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:56:30,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:56:31,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:56:31,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:56:31,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:56:31,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:56:31,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:56:31,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:56:31,089 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:56:31,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:56:31,465 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-08 22:56:31,466 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:56:31,482 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:56:31,482 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:56:31,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:31 BoogieIcfgContainer [2024-11-08 22:56:31,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:56:31,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:56:31,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:56:31,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:56:31,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:56:30" (1/3) ... [2024-11-08 22:56:31,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1d72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:56:31, skipping insertion in model container [2024-11-08 22:56:31,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:30" (2/3) ... [2024-11-08 22:56:31,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a1d72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:56:31, skipping insertion in model container [2024-11-08 22:56:31,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:31" (3/3) ... [2024-11-08 22:56:31,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-2.i [2024-11-08 22:56:31,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:56:31,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:56:31,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:56:31,567 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@416e2c8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:56:31,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:56:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:56:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 22:56:31,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:56:31,580 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:56:31,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:56:31,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:56:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1703130952, now seen corresponding path program 1 times [2024-11-08 22:56:31,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:56:31,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892849671] [2024-11-08 22:56:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:56:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:56:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:56:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:56:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:56:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:56:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:56:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:56:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:56:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:56:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:56:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:56:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:56:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:56:31,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:56:31,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892849671] [2024-11-08 22:56:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892849671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:56:31,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:56:31,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:56:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946211302] [2024-11-08 22:56:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:56:31,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:56:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:56:32,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:56:32,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:56:32,005 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:56:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:56:32,034 INFO L93 Difference]: Finished difference Result 97 states and 158 transitions. [2024-11-08 22:56:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:56:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-11-08 22:56:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:56:32,045 INFO L225 Difference]: With dead ends: 97 [2024-11-08 22:56:32,046 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 22:56:32,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:56:32,056 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:56:32,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:56:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 22:56:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 22:56:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:56:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2024-11-08 22:56:32,104 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 81 [2024-11-08 22:56:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:56:32,106 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2024-11-08 22:56:32,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:56:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2024-11-08 22:56:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 22:56:32,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:56:32,110 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:56:32,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:56:32,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:56:32,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:56:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2104728188, now seen corresponding path program 1 times [2024-11-08 22:56:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:56:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217738213] [2024-11-08 22:56:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:56:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:56:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:56:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:56:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:56:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:56:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:56:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:56:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:56:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:56:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:56:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:56:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:56:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:56:33,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:56:33,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217738213] [2024-11-08 22:56:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217738213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:56:33,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:56:33,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:56:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574346930] [2024-11-08 22:56:33,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:56:33,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:56:33,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:56:33,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:56:33,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:56:33,087 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:56:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:56:33,827 INFO L93 Difference]: Finished difference Result 110 states and 155 transitions. [2024-11-08 22:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:56:33,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-08 22:56:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:56:33,831 INFO L225 Difference]: With dead ends: 110 [2024-11-08 22:56:33,831 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 22:56:33,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:56:33,834 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:56:33,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 139 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:56:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 22:56:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2024-11-08 22:56:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:56:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-08 22:56:33,850 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 81 [2024-11-08 22:56:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:56:33,852 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-08 22:56:33,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:56:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-08 22:56:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 22:56:33,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:56:33,855 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:56:33,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:56:33,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:56:33,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:56:33,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1510180738, now seen corresponding path program 1 times [2024-11-08 22:56:33,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:56:33,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096968073] [2024-11-08 22:56:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:56:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:56:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:56:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:56:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:56:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:56:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:56:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:56:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:56:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:56:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:56:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:56:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:56:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:56:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:56:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096968073] [2024-11-08 22:56:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096968073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:56:34,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:56:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:56:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204363648] [2024-11-08 22:56:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:56:34,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:56:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:56:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:56:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:56:34,240 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:56:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:56:34,673 INFO L93 Difference]: Finished difference Result 118 states and 167 transitions. [2024-11-08 22:56:34,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:56:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-08 22:56:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:56:34,675 INFO L225 Difference]: With dead ends: 118 [2024-11-08 22:56:34,675 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 22:56:34,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:56:34,677 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:56:34,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 308 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:56:34,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 22:56:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2024-11-08 22:56:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:56:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2024-11-08 22:56:34,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 81 [2024-11-08 22:56:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:56:34,686 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-08 22:56:34,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:56:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2024-11-08 22:56:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 22:56:34,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:56:34,688 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:56:34,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:56:34,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:56:34,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:56:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1629032461, now seen corresponding path program 1 times [2024-11-08 22:56:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:56:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392209184] [2024-11-08 22:56:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:56:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:56:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:56:34,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [234224305] [2024-11-08 22:56:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:56:34,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:56:34,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:56:34,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:56:34,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:56:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:56:34,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:56:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:56:34,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:56:34,915 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:56:34,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:56:34,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:56:35,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:56:35,122 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 22:56:35,200 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:56:35,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:56:35 BoogieIcfgContainer [2024-11-08 22:56:35,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:56:35,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:56:35,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:56:35,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:56:35,206 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:31" (3/4) ... [2024-11-08 22:56:35,208 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:56:35,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:56:35,210 INFO L158 Benchmark]: Toolchain (without parser) took 4782.28ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 102.5MB in the beginning and 188.8MB in the end (delta: -86.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:56:35,210 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:56:35,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.93ms. Allocated memory is still 159.4MB. Free memory was 102.0MB in the beginning and 87.7MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 22:56:35,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.26ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 84.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:56:35,211 INFO L158 Benchmark]: Boogie Preprocessor took 73.43ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 79.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:56:35,211 INFO L158 Benchmark]: RCFGBuilder took 558.58ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 79.5MB in the beginning and 185.8MB in the end (delta: -106.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-08 22:56:35,212 INFO L158 Benchmark]: TraceAbstraction took 3719.41ms. Allocated memory is still 222.3MB. Free memory was 185.0MB in the beginning and 189.8MB in the end (delta: -4.8MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. [2024-11-08 22:56:35,212 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 222.3MB. Free memory was 189.8MB in the beginning and 188.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:56:35,214 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.23ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.93ms. Allocated memory is still 159.4MB. Free memory was 102.0MB in the beginning and 87.7MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.26ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 84.1MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.43ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 79.5MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 558.58ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 79.5MB in the beginning and 185.8MB in the end (delta: -106.4MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3719.41ms. Allocated memory is still 222.3MB. Free memory was 185.0MB in the beginning and 189.8MB in the end (delta: -4.8MB). Peak memory consumption was 124.2MB. Max. memory is 16.1GB. * Witness Printer took 4.02ms. Allocated memory is still 222.3MB. Free memory was 189.8MB in the beginning and 188.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someUnaryDOUBLEoperation at line 29. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int var_1_5 = 200; [L24] unsigned short int var_1_6 = 56955; [L25] unsigned short int var_1_7 = 32; [L26] unsigned short int var_1_8 = 1; [L27] unsigned short int var_1_9 = 8; [L28] unsigned char var_1_10 = 1; [L29] float var_1_11 = -0.6; [L30] float var_1_12 = 9.125; [L31] float var_1_13 = 50.5; [L32] unsigned short int last_1_var_1_1 = 10; [L33] unsigned short int last_1_var_1_9 = 8; VAL [isInitial=0, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=200, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_1 = var_1_1 [L86] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=200, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L66] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L66] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=56955, var_1_7=32, var_1_8=1, var_1_9=8] [L67] var_1_6 = __VERIFIER_nondet_ushort() [L68] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L68] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L69] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L69] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=32, var_1_8=1, var_1_9=8] [L70] var_1_7 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L71] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_8=1, var_1_9=8] [L72] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=1, var_1_9=8] [L72] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=1, var_1_9=8] [L73] var_1_8 = __VERIFIER_nondet_ushort() [L74] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_9=8] [L74] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_9=8] [L75] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L75] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=1, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L76] var_1_10 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L77] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L78] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L78] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_12=73/8, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L79] var_1_12 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L80] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_13=101/2, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L81] var_1_13 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L82] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=10, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L97] RET updateVariables() [L98] CALL step() [L37] COND TRUE last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1) [L38] var_1_1 = ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=8] [L40] COND FALSE !(var_1_10 || (var_1_6 == var_1_8)) [L51] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=32767] [L53] COND FALSE !(var_1_7 != var_1_6) [L60] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=32767] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=32767] [L89] EXPR (var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6)) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=32767] [L89] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=32767] [L89-L90] return (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? (var_1_1 == ((unsigned short int) ((((var_1_5) > ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8))))) ? (var_1_5) : ((((((var_1_6 - var_1_7)) > (var_1_8)) ? ((var_1_6 - var_1_7)) : (var_1_8)))))))) : 1) && ((var_1_10 || (var_1_6 == var_1_8)) ? ((var_1_6 <= (((((0) < (var_1_1)) ? (0) : (var_1_1))) << var_1_1)) ? ((var_1_10 && (var_1_1 == (var_1_6 * var_1_5))) ? (var_1_9 == ((unsigned short int) var_1_5)) : (var_1_9 == ((unsigned short int) var_1_5))) : (var_1_9 == ((unsigned short int) 2))) : (var_1_9 == ((unsigned short int) var_1_6)))) && ((var_1_7 != var_1_6) ? ((var_1_7 <= var_1_9) ? (var_1_11 == ((float) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((float) var_1_12))) : (var_1_11 == ((float) var_1_12))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10=0, var_1_11=2, var_1_12=2, var_1_1=32768, var_1_5=0, var_1_6=32767, var_1_7=-32769, var_1_8=32768, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 513 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 208 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:56:35,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 367edc47af4ec003a96fd86b04464a3d0c779fcc885147096dbe680589605201 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:56:37,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:56:37,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:56:37,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:56:37,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:56:37,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:56:37,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:56:37,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:56:37,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:56:37,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:56:37,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:56:37,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:56:37,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:56:37,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:56:37,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:56:37,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:56:37,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:56:37,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:56:37,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:56:37,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:56:37,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:56:37,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:56:37,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:56:37,649 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:56:37,649 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:56:37,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:56:37,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:56:37,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:56:37,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:56:37,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:56:37,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:56:37,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:56:37,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:56:37,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:56:37,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:56:37,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:56:37,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:56:37,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:56:37,653 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:56:37,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:56:37,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:56:37,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:56:37,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:56:37,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:56:37,655 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 367edc47af4ec003a96fd86b04464a3d0c779fcc885147096dbe680589605201 [2024-11-08 22:56:38,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:56:38,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:56:38,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:56:38,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:56:38,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:56:38,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i [2024-11-08 22:56:39,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:56:39,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:56:39,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i [2024-11-08 22:56:39,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd522aa75/44d7b43b44a247f1b13e85220dcf3e27/FLAGde7ff3962 [2024-11-08 22:56:40,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd522aa75/44d7b43b44a247f1b13e85220dcf3e27 [2024-11-08 22:56:40,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:56:40,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:56:40,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:56:40,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:56:40,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:56:40,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea6a68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40, skipping insertion in model container [2024-11-08 22:56:40,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:56:40,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i[916,929] [2024-11-08 22:56:40,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:56:40,559 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:56:40,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-2.i[916,929] [2024-11-08 22:56:40,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:56:40,621 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:56:40,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40 WrapperNode [2024-11-08 22:56:40,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:56:40,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:56:40,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:56:40,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:56:40,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,663 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-11-08 22:56:40,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:56:40,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:56:40,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:56:40,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:56:40,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,699 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:56:40,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:56:40,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:56:40,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:56:40,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:56:40,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (1/1) ... [2024-11-08 22:56:40,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:56:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:56:40,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:56:40,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:56:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:56:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:56:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:56:40,899 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:56:40,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:56:41,188 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 22:56:41,189 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:56:41,205 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:56:41,205 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:56:41,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:41 BoogieIcfgContainer [2024-11-08 22:56:41,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:56:41,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:56:41,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:56:41,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:56:41,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:56:40" (1/3) ... [2024-11-08 22:56:41,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5daca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:56:41, skipping insertion in model container [2024-11-08 22:56:41,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:56:40" (2/3) ... [2024-11-08 22:56:41,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a5daca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:56:41, skipping insertion in model container [2024-11-08 22:56:41,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:56:41" (3/3) ... [2024-11-08 22:56:41,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-2.i [2024-11-08 22:56:41,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:56:41,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:56:41,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:56:41,327 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;@20c8d176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:56:41,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:56:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:56:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 22:56:41,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:56:41,344 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:56:41,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:56:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:56:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash -475101046, now seen corresponding path program 1 times [2024-11-08 22:56:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:56:41,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575254649] [2024-11-08 22:56:41,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:56:41,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:56:41,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:56:41,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:56:41,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:56:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:41,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:56:41,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:56:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-08 22:56:41,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:56:41,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:56:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575254649] [2024-11-08 22:56:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575254649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:56:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:56:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:56:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081148327] [2024-11-08 22:56:41,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:56:41,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:56:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:56:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:56:41,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:56:41,656 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:56:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:56:41,679 INFO L93 Difference]: Finished difference Result 81 states and 134 transitions. [2024-11-08 22:56:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:56:41,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-08 22:56:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:56:41,690 INFO L225 Difference]: With dead ends: 81 [2024-11-08 22:56:41,690 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 22:56:41,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:56:41,699 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:56:41,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:56:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 22:56:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 22:56:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:56:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2024-11-08 22:56:41,741 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 79 [2024-11-08 22:56:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:56:41,742 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2024-11-08 22:56:41,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:56:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2024-11-08 22:56:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 22:56:41,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:56:41,745 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:56:41,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:56:41,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:56:41,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:56:41,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:56:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2098690894, now seen corresponding path program 1 times [2024-11-08 22:56:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:56:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814793235] [2024-11-08 22:56:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:56:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:56:41,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:56:41,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:56:41,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:56:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:56:42,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 22:56:42,147 INFO L278 TraceCheckSpWp]: Computing forward predicates...