./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d641f0fce6003e45544d7b313fe1ff9fa273efb3a1cdf3caa63db5b3b8db2e1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:55:31,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:55:31,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:55:31,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:55:31,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:55:31,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:55:31,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:55:31,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:55:31,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:55:31,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:55:31,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:55:31,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:55:31,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:55:31,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:55:31,357 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:55:31,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:55:31,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:55:31,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:55:31,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:55:31,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:55:31,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:55:31,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:55:31,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:55:31,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:55:31,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:55:31,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:55:31,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:55:31,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:55:31,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:55:31,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:55:31,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:55:31,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:55:31,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:31,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:55:31,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:55:31,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:55:31,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:55:31,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:55:31,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:55:31,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:55:31,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:55:31,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:55:31,376 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d641f0fce6003e45544d7b313fe1ff9fa273efb3a1cdf3caa63db5b3b8db2e1d [2024-10-11 10:55:31,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:55:31,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:55:31,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:55:31,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:55:31,856 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:55:31,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i [2024-10-11 10:55:33,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:55:33,714 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:55:33,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i [2024-10-11 10:55:33,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e381aacb/28b5ac3cb9554088851aa6dcb56538d8/FLAG8b84b73aa [2024-10-11 10:55:34,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e381aacb/28b5ac3cb9554088851aa6dcb56538d8 [2024-10-11 10:55:34,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:55:34,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:55:34,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:34,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:55:34,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:55:34,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65937e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34, skipping insertion in model container [2024-10-11 10:55:34,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:55:34,305 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i[915,928] [2024-10-11 10:55:34,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:34,355 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:55:34,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i[915,928] [2024-10-11 10:55:34,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:34,402 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:55:34,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34 WrapperNode [2024-10-11 10:55:34,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:34,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:34,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:55:34,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:55:34,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,459 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-11 10:55:34,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:34,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:55:34,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:55:34,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:55:34,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,500 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:55:34,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:55:34,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:55:34,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:55:34,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:55:34,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (1/1) ... [2024-10-11 10:55:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:34,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:55:34,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:55:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:55:34,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:55:34,653 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:55:34,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:55:34,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:55:34,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:55:34,789 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:55:34,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:55:35,024 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:55:35,024 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:55:35,065 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:55:35,065 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:55:35,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:35 BoogieIcfgContainer [2024-10-11 10:55:35,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:55:35,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:55:35,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:55:35,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:55:35,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:55:34" (1/3) ... [2024-10-11 10:55:35,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:35, skipping insertion in model container [2024-10-11 10:55:35,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:34" (2/3) ... [2024-10-11 10:55:35,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f21d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:35, skipping insertion in model container [2024-10-11 10:55:35,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:35" (3/3) ... [2024-10-11 10:55:35,072 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-4.i [2024-10-11 10:55:35,085 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:55:35,086 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:55:35,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:55:35,135 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;@7b2ac13e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:55:35,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:55:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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-10-11 10:55:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 10:55:35,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:35,154 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] [2024-10-11 10:55:35,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:35,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash -420194955, now seen corresponding path program 1 times [2024-10-11 10:55:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963499321] [2024-10-11 10:55:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:35,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:55:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:55:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:55:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:55:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:55:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:55:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 10:55:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:55:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 10:55:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 10:55:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 10:55:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 10:55:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:55:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:35,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963499321] [2024-10-11 10:55:35,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963499321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:35,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:35,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:55:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873168757] [2024-10-11 10:55:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:35,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:55:35,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:35,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:55:35,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:55:35,619 INFO L87 Difference]: Start difference. First operand has 45 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-10-11 10:55:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:35,684 INFO L93 Difference]: Finished difference Result 87 states and 157 transitions. [2024-10-11 10:55:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:55:35,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (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 112 [2024-10-11 10:55:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:35,698 INFO L225 Difference]: With dead ends: 87 [2024-10-11 10:55:35,699 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 10:55:35,704 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-10-11 10:55:35,710 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:35,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:55:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 10:55:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 10:55:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-10-11 10:55:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2024-10-11 10:55:35,756 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 112 [2024-10-11 10:55:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:35,757 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2024-10-11 10:55:35,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (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-10-11 10:55:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2024-10-11 10:55:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 10:55:35,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:35,766 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] [2024-10-11 10:55:35,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:55:35,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:35,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2019897041, now seen corresponding path program 1 times [2024-10-11 10:55:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093514546] [2024-10-11 10:55:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:55:36,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341280896] [2024-10-11 10:55:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:36,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:36,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:36,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:55:36,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:55:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:36,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 10:55:36,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-11 10:55:38,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:55:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 10:55:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093514546] [2024-10-11 10:55:38,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 10:55:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341280896] [2024-10-11 10:55:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341280896] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:55:38,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:55:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-10-11 10:55:38,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145313782] [2024-10-11 10:55:38,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:55:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 10:55:38,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:38,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 10:55:38,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=133, Unknown=5, NotChecked=0, Total=182 [2024-10-11 10:55:38,803 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-11 10:55:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:40,336 INFO L93 Difference]: Finished difference Result 139 states and 204 transitions. [2024-10-11 10:55:40,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 10:55:40,337 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 112 [2024-10-11 10:55:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:40,339 INFO L225 Difference]: With dead ends: 139 [2024-10-11 10:55:40,339 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 10:55:40,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=379, Unknown=5, NotChecked=0, Total=552 [2024-10-11 10:55:40,341 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 106 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 74 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:40,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 151 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 327 Invalid, 7 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 10:55:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 10:55:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2024-10-11 10:55:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 10:55:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2024-10-11 10:55:40,383 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 112 [2024-10-11 10:55:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:40,383 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2024-10-11 10:55:40,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2024-10-11 10:55:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2024-10-11 10:55:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 10:55:40,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:40,386 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] [2024-10-11 10:55:40,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:55:40,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:40,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 500062893, now seen corresponding path program 1 times [2024-10-11 10:55:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380388853] [2024-10-11 10:55:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:55:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668662114] [2024-10-11 10:55:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:40,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:55:40,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:55:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:55:41,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:55:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:55:41,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:55:41,169 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:55:41,170 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:55:41,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:55:41,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:41,375 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:55:41,448 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:55:41,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:55:41 BoogieIcfgContainer [2024-10-11 10:55:41,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:55:41,453 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:55:41,453 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:55:41,453 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:55:41,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:35" (3/4) ... [2024-10-11 10:55:41,455 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:55:41,456 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:55:41,456 INFO L158 Benchmark]: Toolchain (without parser) took 7333.53ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 144.4MB in the beginning and 83.5MB in the end (delta: 60.9MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-10-11 10:55:41,457 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:55:41,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.24ms. Allocated memory is still 184.5MB. Free memory was 144.4MB in the beginning and 130.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:55:41,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.56ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 127.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:55:41,458 INFO L158 Benchmark]: Boogie Preprocessor took 70.19ms. Allocated memory is still 184.5MB. Free memory was 127.1MB in the beginning and 122.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:55:41,458 INFO L158 Benchmark]: RCFGBuilder took 532.40ms. Allocated memory is still 184.5MB. Free memory was 122.2MB in the beginning and 135.7MB in the end (delta: -13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 10:55:41,459 INFO L158 Benchmark]: TraceAbstraction took 6384.83ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 135.7MB in the beginning and 83.5MB in the end (delta: 52.2MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2024-10-11 10:55:41,459 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 239.1MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:55:41,460 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 100.7MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.24ms. Allocated memory is still 184.5MB. Free memory was 144.4MB in the beginning and 130.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.56ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 127.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.19ms. Allocated memory is still 184.5MB. Free memory was 127.1MB in the beginning and 122.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.40ms. Allocated memory is still 184.5MB. Free memory was 122.2MB in the beginning and 135.7MB in the end (delta: -13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6384.83ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 135.7MB in the beginning and 83.5MB in the end (delta: 52.2MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 239.1MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 5; [L23] signed short int var_1_3 = -25; [L24] unsigned short int var_1_7 = 4; [L25] unsigned char var_1_8 = 4; [L26] unsigned char var_1_10 = 4; [L27] unsigned char var_1_11 = 8; [L28] unsigned long int var_1_12 = 10; [L29] signed long int var_1_13 = 99; [L30] signed long int var_1_14 = 127; [L31] signed long int var_1_15 = 16; [L32] signed long int var_1_16 = 256; [L33] unsigned long int var_1_17 = 4288034294; [L34] unsigned char var_1_18 = 0; [L35] unsigned long int last_1_var_1_12 = 10; [L36] unsigned char last_1_var_1_18 = 0; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L91] last_1_var_1_12 = var_1_12 [L92] last_1_var_1_18 = var_1_18 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L62] var_1_3 = __VERIFIER_nondet_short() [L63] CALL assume_abort_if_not(var_1_3 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L63] RET assume_abort_if_not(var_1_3 >= -32768) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L64] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L64] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L65] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L65] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=4, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L66] var_1_10 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L67] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L68] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L68] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=8, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L69] var_1_11 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L71] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L71] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=99, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L72] var_1_13 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L73] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L74] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L74] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=127, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L75] var_1_14 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L76] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L77] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L77] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=16, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L78] var_1_15 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L79] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L80] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L80] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L81] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L81] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=256, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L82] var_1_16 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L83] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L84] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L84] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L85] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L85] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=4288034294, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L86] var_1_17 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L87] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L88] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L88] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L103] RET updateVariables() [L104] CALL step() [L40] unsigned long int stepLocal_2 = last_1_var_1_12 / var_1_3; VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, stepLocal_2=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=4] [L41] COND TRUE stepLocal_2 != (last_1_var_1_18 - 64) [L42] var_1_8 = ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=10, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=2] [L46] COND TRUE (- (var_1_13 / 0.6f)) > ((var_1_14 + 3.25f) / ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16)))) [L47] var_1_12 = (500u + ((((var_1_10) < (var_1_8)) ? (var_1_10) : (var_1_8)))) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=502, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=0, var_1_1=5, var_1_3=-32768, var_1_7=4, var_1_8=2] [L51] var_1_18 = var_1_11 [L52] var_1_7 = var_1_18 [L53] signed long int stepLocal_1 = - var_1_3; [L54] signed long int stepLocal_0 = var_1_7 / var_1_3; VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, stepLocal_0=0, stepLocal_1=32768, var_1_10=-254, var_1_11=-510, var_1_12=502, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=-510, var_1_1=5, var_1_3=-32768, var_1_7=2, var_1_8=2] [L55] COND FALSE !(stepLocal_0 >= var_1_7) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, stepLocal_1=32768, var_1_10=-254, var_1_11=-510, var_1_12=502, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=-510, var_1_1=5, var_1_3=-32768, var_1_7=2, var_1_8=2] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return ((((((var_1_7 / var_1_3) >= var_1_7) ? (((- var_1_3) > var_1_7) ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) : 1) : 1) && (var_1_7 == ((unsigned short int) var_1_18))) && (((last_1_var_1_12 / var_1_3) != (last_1_var_1_18 - 64)) ? (var_1_8 == ((unsigned char) ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) : (var_1_8 == ((unsigned char) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))))) && (((- (var_1_13 / 0.6f)) > ((var_1_14 + 3.25f) / ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? (var_1_12 == ((unsigned long int) (500u + ((((var_1_10) < (var_1_8)) ? (var_1_10) : (var_1_8)))))) : (var_1_12 == ((unsigned long int) (var_1_17 - var_1_10))))) && (var_1_18 == ((unsigned char) var_1_11)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=502, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=-510, var_1_1=5, var_1_3=-32768, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10, last_1_var_1_18=0, var_1_10=-254, var_1_11=-510, var_1_12=502, var_1_13=-2147483648, var_1_14=-2147483648, var_1_15=-1, var_1_16=-1, var_1_17=6442450943, var_1_18=-510, var_1_1=5, var_1_3=-32768, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 100 mSDtfsCounter, 330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 333 ConstructedInterpolants, 2 QuantifiedInterpolants, 2783 SizeOfPredicates, 5 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1956/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-10-11 10:55:41,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d641f0fce6003e45544d7b313fe1ff9fa273efb3a1cdf3caa63db5b3b8db2e1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:55:43,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:55:43,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:55:43,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:55:43,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:55:43,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:55:43,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:55:43,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:55:43,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:55:43,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:55:43,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:55:43,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:55:43,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:55:43,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:55:43,910 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:55:43,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:55:43,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:55:43,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:55:43,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:55:43,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:55:43,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:55:43,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:55:43,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:55:43,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:55:43,913 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:55:43,913 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:55:43,913 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:55:43,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:55:43,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:55:43,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:55:43,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:55:43,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:55:43,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:55:43,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:55:43,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:43,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:55:43,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:55:43,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:55:43,922 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:55:43,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:55:43,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:55:43,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:55:43,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:55:43,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:55:43,924 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:55:43,924 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d641f0fce6003e45544d7b313fe1ff9fa273efb3a1cdf3caa63db5b3b8db2e1d [2024-10-11 10:55:44,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:55:44,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:55:44,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:55:44,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:55:44,204 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:55:44,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i [2024-10-11 10:55:45,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:55:45,846 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:55:45,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i [2024-10-11 10:55:45,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2b67ccf2/474ff14f18d14d848667fdb678a2712b/FLAGe358d5f75 [2024-10-11 10:55:46,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a2b67ccf2/474ff14f18d14d848667fdb678a2712b [2024-10-11 10:55:46,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:55:46,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:55:46,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:46,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:55:46,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:55:46,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681bff0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46, skipping insertion in model container [2024-10-11 10:55:46,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:55:46,392 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i[915,928] [2024-10-11 10:55:46,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:46,452 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:55:46,463 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-4.i[915,928] [2024-10-11 10:55:46,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:46,489 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:55:46,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46 WrapperNode [2024-10-11 10:55:46,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:46,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:46,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:55:46,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:55:46,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,528 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-10-11 10:55:46,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:46,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:55:46,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:55:46,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:55:46,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,551 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:55:46,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:55:46,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:55:46,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:55:46,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:55:46,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (1/1) ... [2024-10-11 10:55:46,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:46,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:46,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:55:46,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:55:46,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:55:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:55:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:55:46,636 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:55:46,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:55:46,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:55:46,707 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:55:46,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:55:59,423 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 10:55:59,424 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:55:59,485 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:55:59,485 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:55:59,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:59 BoogieIcfgContainer [2024-10-11 10:55:59,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:55:59,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:55:59,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:55:59,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:55:59,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:55:46" (1/3) ... [2024-10-11 10:55:59,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722f9b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:59, skipping insertion in model container [2024-10-11 10:55:59,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:46" (2/3) ... [2024-10-11 10:55:59,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722f9b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:59, skipping insertion in model container [2024-10-11 10:55:59,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:59" (3/3) ... [2024-10-11 10:55:59,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-4.i [2024-10-11 10:55:59,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:55:59,507 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:55:59,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:55:59,558 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;@1e405795, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:55:59,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:55:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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-10-11 10:55:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 10:55:59,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:59,576 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] [2024-10-11 10:55:59,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:59,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash -420194955, now seen corresponding path program 1 times [2024-10-11 10:55:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:55:59,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032698705] [2024-10-11 10:55:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:59,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:55:59,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:55:59,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:55:59,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:56:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:00,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:56:00,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:56:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-10-11 10:56:00,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:56:00,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:56:00,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032698705] [2024-10-11 10:56:00,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032698705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:56:00,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:56:00,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:56:00,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35014567] [2024-10-11 10:56:00,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:56:00,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:56:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:56:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:56:00,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:56:00,309 INFO L87 Difference]: Start difference. First operand has 45 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-11 10:56:04,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:56:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:56:04,573 INFO L93 Difference]: Finished difference Result 87 states and 157 transitions. [2024-10-11 10:56:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:56:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (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 112 [2024-10-11 10:56:04,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:56:04,669 INFO L225 Difference]: With dead ends: 87 [2024-10-11 10:56:04,669 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 10:56:04,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:56:04,674 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:56:04,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 10:56:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 10:56:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 10:56:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-10-11 10:56:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2024-10-11 10:56:04,706 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 112 [2024-10-11 10:56:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:56:04,706 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2024-10-11 10:56:04,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (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-10-11 10:56:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2024-10-11 10:56:04,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 10:56:04,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:56:04,709 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] [2024-10-11 10:56:04,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:56:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:56:04,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:56:04,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:56:04,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2019897041, now seen corresponding path program 1 times [2024-10-11 10:56:04,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:56:04,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914744027] [2024-10-11 10:56:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:04,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:56:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:56:04,917 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:56:04,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:56:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:05,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:56:05,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:56:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 150 proven. 48 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-10-11 10:56:14,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:56:17,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:56:17,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914744027] [2024-10-11 10:56:17,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914744027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:56:17,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [591886883] [2024-10-11 10:56:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:56:17,569 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:56:17,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:56:17,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:56:17,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-11 10:56:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:56:18,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:56:18,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:56:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 10:56:24,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:56:24,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [591886883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:56:24,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:56:24,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2024-10-11 10:56:24,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744851200] [2024-10-11 10:56:24,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:56:24,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:56:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:56:24,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:56:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:56:24,028 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-10-11 10:56:31,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:56:35,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:56:39,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:56:43,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:56:47,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:56:52,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:56:56,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:57:01,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:57:05,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:57:09,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:57:13,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 10:57:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:57:13,317 INFO L93 Difference]: Finished difference Result 128 states and 194 transitions. [2024-10-11 10:57:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:57:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 112 [2024-10-11 10:57:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:57:13,440 INFO L225 Difference]: With dead ends: 128 [2024-10-11 10:57:13,440 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 10:57:13,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:57:13,445 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 27 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 39 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:57:13,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 198 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 48.6s Time] [2024-10-11 10:57:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 10:57:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2024-10-11 10:57:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 10:57:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2024-10-11 10:57:13,470 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 112 [2024-10-11 10:57:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:57:13,470 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2024-10-11 10:57:13,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-10-11 10:57:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2024-10-11 10:57:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 10:57:13,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:57:13,472 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] [2024-10-11 10:57:13,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0