./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-40.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-40.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 64021861896ff3019361ecdf462e47b42c45b078cbed39f833fefb859a5a834c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:59:02,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:59:02,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:59:02,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:59:02,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:59:02,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:59:02,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:59:02,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:59:02,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:59:02,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:59:02,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:59:02,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:59:02,351 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:59:02,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:59:02,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:59:02,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:59:02,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:59:02,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:59:02,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:59:02,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:59:02,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:59:02,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:59:02,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:59:02,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:59:02,356 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:59:02,356 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:59:02,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:59:02,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:59:02,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:59:02,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:59:02,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:59:02,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:59:02,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:59:02,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:59:02,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:59:02,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:59:02,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:59:02,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:59:02,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:59:02,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:59:02,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:59:02,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:59:02,359 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 -> 64021861896ff3019361ecdf462e47b42c45b078cbed39f833fefb859a5a834c [2024-11-08 22:59:02,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:59:02,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:59:02,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:59:02,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:59:02,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:59:02,584 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-40.i [2024-11-08 22:59:03,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:59:03,976 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:59:03,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-40.i [2024-11-08 22:59:03,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4cfd838/81576706f9404a4c998795e73ade6aa5/FLAG5998a731f [2024-11-08 22:59:03,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4cfd838/81576706f9404a4c998795e73ade6aa5 [2024-11-08 22:59:04,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:59:04,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:59:04,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:59:04,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:59:04,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:59:04,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:59:03" (1/1) ... [2024-11-08 22:59:04,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1185013c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04, skipping insertion in model container [2024-11-08 22:59:04,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:59:03" (1/1) ... [2024-11-08 22:59:04,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:59:04,163 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-40.i[917,930] [2024-11-08 22:59:04,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:59:04,205 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:59:04,215 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-40.i[917,930] [2024-11-08 22:59:04,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:59:04,246 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:59:04,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04 WrapperNode [2024-11-08 22:59:04,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:59:04,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:59:04,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:59:04,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:59:04,252 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:59:04" (1/1) ... [2024-11-08 22:59:04,263 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:59:04" (1/1) ... [2024-11-08 22:59:04,281 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-08 22:59:04,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:59:04,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:59:04,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:59:04,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:59:04,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,303 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:59:04,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:59:04,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:59:04,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:59:04,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:59:04,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (1/1) ... [2024-11-08 22:59:04,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:59:04,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:59:04,343 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:59:04,345 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:59:04,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:59:04,388 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:59:04,389 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:59:04,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:59:04,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:59:04,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:59:04,458 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:59:04,460 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:59:04,695 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 22:59:04,695 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:59:04,705 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:59:04,705 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:59:04,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:59:04 BoogieIcfgContainer [2024-11-08 22:59:04,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:59:04,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:59:04,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:59:04,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:59:04,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:59:03" (1/3) ... [2024-11-08 22:59:04,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b04d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:59:04, skipping insertion in model container [2024-11-08 22:59:04,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:04" (2/3) ... [2024-11-08 22:59:04,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b04d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:59:04, skipping insertion in model container [2024-11-08 22:59:04,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:59:04" (3/3) ... [2024-11-08 22:59:04,713 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-40.i [2024-11-08 22:59:04,726 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:59:04,726 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:59:04,775 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:59:04,780 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;@24644fbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:59:04,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:59:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 22:59:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 22:59:04,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:59:04,795 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:04,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:59:04,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:59:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash -361794192, now seen corresponding path program 1 times [2024-11-08 22:59:04,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:59:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175552028] [2024-11-08 22:59:04,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:59:04,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:59:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:59:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:59:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:59:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:59:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:59:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:59:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:59:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:59:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 22:59:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:59:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:59:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:59:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:59:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:59:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:59:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 22:59:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:59:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 22:59:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 22:59:05,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:59:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175552028] [2024-11-08 22:59:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175552028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:59:05,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:59:05,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:59:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265322768] [2024-11-08 22:59:05,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:59:05,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:59:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:59:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:59:05,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:59:05,134 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 22:59:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:59:05,183 INFO L93 Difference]: Finished difference Result 121 states and 207 transitions. [2024-11-08 22:59:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:59:05,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-11-08 22:59:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:59:05,199 INFO L225 Difference]: With dead ends: 121 [2024-11-08 22:59:05,199 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 22:59:05,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:59:05,207 INFO L432 NwaCegarLoop]: 90 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, 90 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:59:05,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:59:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 22:59:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 22:59:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 22:59:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2024-11-08 22:59:05,266 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 121 [2024-11-08 22:59:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:59:05,267 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2024-11-08 22:59:05,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 22:59:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-11-08 22:59:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 22:59:05,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:59:05,272 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:05,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:59:05,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:59:05,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:59:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1774031446, now seen corresponding path program 1 times [2024-11-08 22:59:05,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:59:05,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783765460] [2024-11-08 22:59:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:59:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:59:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:59:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:59:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:59:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:59:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:59:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:59:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:59:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:59:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 22:59:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:59:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:59:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:59:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:59:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:59:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:59:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 22:59:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:59:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 22:59:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 22:59:05,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:59:05,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783765460] [2024-11-08 22:59:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783765460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:59:05,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:59:05,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:59:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704482834] [2024-11-08 22:59:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:59:05,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:59:05,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:59:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:59:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:59:05,637 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 22:59:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:59:05,689 INFO L93 Difference]: Finished difference Result 136 states and 203 transitions. [2024-11-08 22:59:05,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:59:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2024-11-08 22:59:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:59:05,691 INFO L225 Difference]: With dead ends: 136 [2024-11-08 22:59:05,692 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 22:59:05,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:59:05,693 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 23 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:59:05,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 264 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:59:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 22:59:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2024-11-08 22:59:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 22:59:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-08 22:59:05,707 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 121 [2024-11-08 22:59:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:59:05,710 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-08 22:59:05,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 22:59:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-08 22:59:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 22:59:05,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:59:05,712 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:05,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:59:05,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:59:05,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:59:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1925075857, now seen corresponding path program 1 times [2024-11-08 22:59:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:59:05,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225369962] [2024-11-08 22:59:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:59:05,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:59:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:59:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:59:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:59:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:59:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:59:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:59:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:59:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:59:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 22:59:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:59:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 22:59:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 22:59:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 22:59:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:59:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:59:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 22:59:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:59:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 22:59:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 22:59:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:59:05,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225369962] [2024-11-08 22:59:05,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225369962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:59:05,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:59:05,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:59:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30575842] [2024-11-08 22:59:05,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:59:05,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:59:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:59:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:59:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:59:05,947 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 22:59:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:59:06,028 INFO L93 Difference]: Finished difference Result 186 states and 275 transitions. [2024-11-08 22:59:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 22:59:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-08 22:59:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:59:06,030 INFO L225 Difference]: With dead ends: 186 [2024-11-08 22:59:06,030 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 22:59:06,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:59:06,033 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:59:06,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 325 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:59:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 22:59:06,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2024-11-08 22:59:06,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 22:59:06,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2024-11-08 22:59:06,048 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 122 [2024-11-08 22:59:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:59:06,050 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2024-11-08 22:59:06,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-08 22:59:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2024-11-08 22:59:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 22:59:06,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:59:06,054 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:06,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:59:06,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:59:06,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:59:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1338269843, now seen corresponding path program 1 times [2024-11-08 22:59:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:59:06,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438810704] [2024-11-08 22:59:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:59:06,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:59:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:59:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603693319] [2024-11-08 22:59:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:59:06,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:59:06,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:59:06,111 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:59:06,113 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:59:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:59:06,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:59:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:59:06,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:59:06,318 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:59:06,319 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:59:06,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 22:59:06,521 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:59:06,524 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 22:59:06,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:59:06,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:59:06 BoogieIcfgContainer [2024-11-08 22:59:06,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:59:06,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:59:06,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:59:06,593 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:59:06,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:59:04" (3/4) ... [2024-11-08 22:59:06,598 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:59:06,599 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:59:06,599 INFO L158 Benchmark]: Toolchain (without parser) took 2597.96ms. Allocated memory was 136.3MB in the beginning and 192.9MB in the end (delta: 56.6MB). Free memory was 68.0MB in the beginning and 99.5MB in the end (delta: -31.5MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-11-08 22:59:06,600 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory was 101.5MB in the beginning and 101.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:59:06,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.12ms. Allocated memory was 136.3MB in the beginning and 192.9MB in the end (delta: 56.6MB). Free memory was 67.9MB in the beginning and 155.0MB in the end (delta: -87.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-08 22:59:06,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.61ms. Allocated memory is still 192.9MB. Free memory was 155.0MB in the beginning and 151.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:59:06,602 INFO L158 Benchmark]: Boogie Preprocessor took 32.00ms. Allocated memory is still 192.9MB. Free memory was 151.7MB in the beginning and 148.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:59:06,602 INFO L158 Benchmark]: RCFGBuilder took 390.94ms. Allocated memory is still 192.9MB. Free memory was 148.7MB in the beginning and 130.7MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:59:06,602 INFO L158 Benchmark]: TraceAbstraction took 1884.52ms. Allocated memory is still 192.9MB. Free memory was 129.8MB in the beginning and 100.5MB in the end (delta: 29.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-08 22:59:06,603 INFO L158 Benchmark]: Witness Printer took 6.17ms. Allocated memory is still 192.9MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:59:06,606 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.15ms. Allocated memory is still 136.3MB. Free memory was 101.5MB in the beginning and 101.4MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.12ms. Allocated memory was 136.3MB in the beginning and 192.9MB in the end (delta: 56.6MB). Free memory was 67.9MB in the beginning and 155.0MB in the end (delta: -87.1MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.61ms. Allocated memory is still 192.9MB. Free memory was 155.0MB in the beginning and 151.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.00ms. Allocated memory is still 192.9MB. Free memory was 151.7MB in the beginning and 148.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.94ms. Allocated memory is still 192.9MB. Free memory was 148.7MB in the beginning and 130.7MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1884.52ms. Allocated memory is still 192.9MB. Free memory was 129.8MB in the beginning and 100.5MB in the end (delta: 29.3MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Witness Printer took 6.17ms. Allocated memory is still 192.9MB. Free memory was 100.5MB in the beginning and 99.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 64; [L26] signed long int var_1_8 = -2; [L27] signed long int var_1_9 = -10; [L28] unsigned char var_1_11 = 128; [L29] unsigned char var_1_12 = 1; [L30] double var_1_13 = 8.4; [L31] double var_1_15 = 49.75; [L32] signed char var_1_16 = -2; [L33] signed char var_1_17 = 25; [L34] signed char var_1_18 = -5; [L35] float var_1_19 = 7.5; [L36] signed short int var_1_20 = 1; [L37] signed short int var_1_21 = -256; [L38] double last_1_var_1_13 = 8.4; VAL [isInitial=0, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=0, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L97] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=0, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=0, var_1_7=64, var_1_8=-2, var_1_9=-10] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-2, var_1_9=-10] [L73] var_1_8 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L74] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L75] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L76] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=-10] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L80] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L80] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=128, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L82] RET assume_abort_if_not(var_1_11 >= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L83] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L83] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=1, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L84] var_1_12 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L85] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L86] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L86] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=199/4, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L87] var_1_15 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L88] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=25, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L89] var_1_17 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L90] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L91] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L91] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-5, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L92] var_1_18 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L93] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L94] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L94] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-2, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L108] RET updateVariables() [L109] CALL step() [L42] COND TRUE \read(var_1_3) [L43] var_1_16 = ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=15/2, var_1_1=-4, var_1_20=1, var_1_21=-256, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L45] var_1_19 = var_1_15 [L46] var_1_20 = var_1_16 [L47] var_1_21 = var_1_18 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L48] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L49] COND FALSE !(var_1_3 && (var_1_19 <= (- 63.9f))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L57] EXPR var_1_21 | var_1_16 VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=64, var_1_8=-1, var_1_9=3] [L57] COND TRUE ((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16) [L58] var_1_7 = (var_1_11 - var_1_12) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_13=42/5, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=3] [L62] COND TRUE var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19))) [L63] var_1_13 = (var_1_15 + (127.4 - 8.25)) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=3] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=3] [L100-L101] return ((((((var_1_2 ? ((var_1_3 && (var_1_19 <= (- 63.9f))) ? ((var_1_19 >= var_1_19) ? (var_1_3 ? (var_1_1 == ((signed long int) var_1_21)) : 1) : 1) : 1) : 1) && ((((var_1_16 / var_1_8) / var_1_9) >= (var_1_21 | var_1_16)) ? (var_1_7 == ((unsigned char) (var_1_11 - var_1_12))) : (var_1_7 == ((unsigned char) var_1_12)))) && ((var_1_19 != ((((last_1_var_1_13) < (var_1_19)) ? (last_1_var_1_13) : (var_1_19)))) ? (var_1_13 == ((double) (var_1_15 + (127.4 - 8.25)))) : 1)) && (var_1_3 ? (var_1_16 == ((signed char) ((((var_1_17) > ((-2 + var_1_18))) ? (var_1_17) : ((-2 + var_1_18)))))) : 1)) && (var_1_19 == ((float) var_1_15))) && (var_1_20 == ((signed short int) var_1_16))) && (var_1_21 == ((signed short int) var_1_18)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=42/5, var_1_11=127, var_1_12=0, var_1_15=2, var_1_16=-1, var_1_17=-1, var_1_18=-1, var_1_19=2, var_1_1=-4, var_1_20=-1, var_1_21=-1, var_1_2=1, var_1_3=1, var_1_7=127, var_1_8=-1, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 679 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 298 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=3, InterpolantAutomatonStates: 12, 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, 41 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 608 NumberOfCodeBlocks, 608 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2052/2052 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:59:06,631 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-40.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 64021861896ff3019361ecdf462e47b42c45b078cbed39f833fefb859a5a834c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:59:08,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:59:08,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:59:08,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:59:08,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:59:08,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:59:08,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:59:08,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:59:08,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:59:08,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:59:08,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:59:08,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:59:08,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:59:08,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:59:08,558 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:59:08,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:59:08,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:59:08,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:59:08,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:59:08,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:59:08,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:59:08,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:59:08,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:59:08,563 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:59:08,563 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:59:08,564 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:59:08,564 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:59:08,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:59:08,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:59:08,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:59:08,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:59:08,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:59:08,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:59:08,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:59:08,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:59:08,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:59:08,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:59:08,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:59:08,565 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:59:08,566 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:59:08,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:59:08,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:59:08,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:59:08,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:59:08,567 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 -> 64021861896ff3019361ecdf462e47b42c45b078cbed39f833fefb859a5a834c [2024-11-08 22:59:08,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:59:08,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:59:08,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:59:08,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:59:08,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:59:08,848 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-40.i [2024-11-08 22:59:10,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:59:10,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:59:10,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-40.i [2024-11-08 22:59:10,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b23ccb1b3/1fdfd7b979314dacbf6b576a4b270774/FLAG85ea17fdf [2024-11-08 22:59:10,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b23ccb1b3/1fdfd7b979314dacbf6b576a4b270774 [2024-11-08 22:59:10,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:59:10,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:59:10,338 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:59:10,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:59:10,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:59:10,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4843f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10, skipping insertion in model container [2024-11-08 22:59:10,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:59:10,510 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-40.i[917,930] [2024-11-08 22:59:10,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:59:10,578 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:59:10,588 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-40.i[917,930] [2024-11-08 22:59:10,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:59:10,639 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:59:10,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10 WrapperNode [2024-11-08 22:59:10,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:59:10,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:59:10,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:59:10,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:59:10,647 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:59:10" (1/1) ... [2024-11-08 22:59:10,662 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:59:10" (1/1) ... [2024-11-08 22:59:10,689 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-08 22:59:10,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:59:10,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:59:10,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:59:10,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:59:10,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,725 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:59:10,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:59:10,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:59:10,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:59:10,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:59:10,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (1/1) ... [2024-11-08 22:59:10,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:59:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:59:10,788 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:59:10,794 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:59:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:59:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:59:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:59:10,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:59:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:59:10,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:59:10,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:59:10,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:59:12,839 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 22:59:12,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:59:12,850 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:59:12,850 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:59:12,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:59:12 BoogieIcfgContainer [2024-11-08 22:59:12,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:59:12,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:59:12,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:59:12,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:59:12,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:59:10" (1/3) ... [2024-11-08 22:59:12,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ead55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:59:12, skipping insertion in model container [2024-11-08 22:59:12,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:59:10" (2/3) ... [2024-11-08 22:59:12,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ead55f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:59:12, skipping insertion in model container [2024-11-08 22:59:12,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:59:12" (3/3) ... [2024-11-08 22:59:12,855 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-40.i [2024-11-08 22:59:12,866 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:59:12,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:59:12,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:59:12,926 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;@562117f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:59:12,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:59:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 22:59:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 22:59:12,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:59:12,938 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:12,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:59:12,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:59:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash -261305118, now seen corresponding path program 1 times [2024-11-08 22:59:12,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:59:12,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861684589] [2024-11-08 22:59:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:59:12,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:59:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:59:12,954 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:59:12,954 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:59:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:13,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:59:13,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:59:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-08 22:59:13,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:59:13,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:59:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861684589] [2024-11-08 22:59:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861684589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:59:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:59:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:59:13,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815482408] [2024-11-08 22:59:13,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:59:13,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:59:13,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:59:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:59:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:59:13,343 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 22:59:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:59:13,360 INFO L93 Difference]: Finished difference Result 103 states and 179 transitions. [2024-11-08 22:59:13,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:59:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 118 [2024-11-08 22:59:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:59:13,366 INFO L225 Difference]: With dead ends: 103 [2024-11-08 22:59:13,366 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 22:59:13,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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:59:13,371 INFO L432 NwaCegarLoop]: 76 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, 76 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:59:13,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:59:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 22:59:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 22:59:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 22:59:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2024-11-08 22:59:13,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 118 [2024-11-08 22:59:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:59:13,400 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2024-11-08 22:59:13,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-08 22:59:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2024-11-08 22:59:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 22:59:13,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:59:13,404 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:13,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:59:13,604 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:59:13,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:59:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:59:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -88781080, now seen corresponding path program 1 times [2024-11-08 22:59:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:59:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334170382] [2024-11-08 22:59:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:59:13,607 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:59:13,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:59:13,608 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:59:13,609 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:59:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:59:13,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 22:59:13,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:00:07,859 WARN L286 SmtUtils]: Spent 11.97s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)