./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-37.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-37.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 27e8564535ea94ba0a863541d1c14289d03df32702288432171c1c39cf06e605 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:55:21,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:55:21,402 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:21,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:55:21,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:55:21,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:55:21,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:55:21,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:55:21,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:55:21,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:55:21,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:55:21,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:55:21,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:55:21,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:55:21,448 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:55:21,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:55:21,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:55:21,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:55:21,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:55:21,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:55:21,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:55:21,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:55:21,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:55:21,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:55:21,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:55:21,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:55:21,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:55:21,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:55:21,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:55:21,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:55:21,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:55:21,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:55:21,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:21,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:55:21,455 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:55:21,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:55:21,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:55:21,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:55:21,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:55:21,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:55:21,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:55:21,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:55:21,458 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 -> 27e8564535ea94ba0a863541d1c14289d03df32702288432171c1c39cf06e605 [2024-10-11 10:55:21,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:55:21,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:55:21,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:55:21,824 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:55:21,824 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:55:21,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-37.i [2024-10-11 10:55:23,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:55:23,473 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:55:23,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-37.i [2024-10-11 10:55:23,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e34a966ce/8f8b7165e62d41c0a7b627f0ad98bbb2/FLAGf88d9e6b5 [2024-10-11 10:55:23,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e34a966ce/8f8b7165e62d41c0a7b627f0ad98bbb2 [2024-10-11 10:55:23,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:55:23,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:55:23,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:23,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:55:23,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:55:23,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:23" (1/1) ... [2024-10-11 10:55:23,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bef941a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:23, skipping insertion in model container [2024-10-11 10:55:23,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:23" (1/1) ... [2024-10-11 10:55:23,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:55:24,066 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-37.i[916,929] [2024-10-11 10:55:24,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:24,123 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:55:24,134 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-37.i[916,929] [2024-10-11 10:55:24,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:24,182 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:55:24,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:24 WrapperNode [2024-10-11 10:55:24,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:24,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:24,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:55:24,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:55:24,198 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:24" (1/1) ... [2024-10-11 10:55:24,208 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:24" (1/1) ... [2024-10-11 10:55:24,241 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2024-10-11 10:55:24,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:24,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:55:24,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:55:24,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:55:24,255 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:24" (1/1) ... [2024-10-11 10:55:24,255 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:24" (1/1) ... [2024-10-11 10:55:24,258 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:24" (1/1) ... [2024-10-11 10:55:24,273 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:24,274 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:24" (1/1) ... [2024-10-11 10:55:24,274 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:24" (1/1) ... [2024-10-11 10:55:24,280 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:24" (1/1) ... [2024-10-11 10:55:24,283 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:24" (1/1) ... [2024-10-11 10:55:24,285 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:24" (1/1) ... [2024-10-11 10:55:24,287 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:24" (1/1) ... [2024-10-11 10:55:24,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:55:24,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:55:24,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:55:24,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:55:24,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:24" (1/1) ... [2024-10-11 10:55:24,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:24,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:24,346 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:24,349 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:24,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:55:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:55:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:55:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:55:24,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:55:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:55:24,519 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:55:24,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:55:24,862 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:55:24,862 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:55:24,923 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:55:24,923 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:55:24,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:24 BoogieIcfgContainer [2024-10-11 10:55:24,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:55:24,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:55:24,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:55:24,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:55:24,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:55:23" (1/3) ... [2024-10-11 10:55:24,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b29798b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:24, skipping insertion in model container [2024-10-11 10:55:24,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:24" (2/3) ... [2024-10-11 10:55:24,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b29798b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:24, skipping insertion in model container [2024-10-11 10:55:24,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:24" (3/3) ... [2024-10-11 10:55:24,936 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-37.i [2024-10-11 10:55:24,952 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:55:24,952 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:55:25,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:55:25,016 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;@3c6e404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:55:25,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:55:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:55:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 10:55:25,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:25,029 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:25,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:25,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1729419295, now seen corresponding path program 1 times [2024-10-11 10:55:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31903287] [2024-10-11 10:55:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:55:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31903287] [2024-10-11 10:55:25,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31903287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:25,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:55:25,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282778211] [2024-10-11 10:55:25,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:55:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:25,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:55:25,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:55:25,490 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:55:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:25,528 INFO L93 Difference]: Finished difference Result 101 states and 174 transitions. [2024-10-11 10:55:25,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:55:25,532 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-10-11 10:55:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:25,541 INFO L225 Difference]: With dead ends: 101 [2024-10-11 10:55:25,541 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 10:55:25,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:55:25,548 INFO L432 NwaCegarLoop]: 72 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, 72 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:25,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 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:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 10:55:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 10:55:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:55:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-11 10:55:25,603 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 101 [2024-10-11 10:55:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:25,605 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-11 10:55:25,606 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 10:55:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-11 10:55:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 10:55:25,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:25,611 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:25,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:55:25,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:25,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1362491423, now seen corresponding path program 1 times [2024-10-11 10:55:25,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:25,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448781965] [2024-10-11 10:55:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:25,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:55:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:55:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:55:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:55:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:55:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:55:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:55:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:55:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:55:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:55:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:55:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:55:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:55:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:55:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:55:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:55:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-10-11 10:55:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448781965] [2024-10-11 10:55:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448781965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:55:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513015502] [2024-10-11 10:55:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:26,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:26,544 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:26,547 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:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:26,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 10:55:26,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 227 proven. 69 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 10:55:27,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:55:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-10-11 10:55:27,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513015502] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:55:27,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:55:27,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2024-10-11 10:55:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689758530] [2024-10-11 10:55:27,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:55:27,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 10:55:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:27,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 10:55:27,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2024-10-11 10:55:27,999 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 21 states have internal predecessors, (58), 9 states have call successors, (46), 4 states have call predecessors, (46), 7 states have return successors, (47), 5 states have call predecessors, (47), 9 states have call successors, (47) [2024-10-11 10:55:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:28,638 INFO L93 Difference]: Finished difference Result 115 states and 162 transitions. [2024-10-11 10:55:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 10:55:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 21 states have internal predecessors, (58), 9 states have call successors, (46), 4 states have call predecessors, (46), 7 states have return successors, (47), 5 states have call predecessors, (47), 9 states have call successors, (47) Word has length 101 [2024-10-11 10:55:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:28,641 INFO L225 Difference]: With dead ends: 115 [2024-10-11 10:55:28,641 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 10:55:28,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2024-10-11 10:55:28,646 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 129 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:28,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 198 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:55:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 10:55:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-10-11 10:55:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:55:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2024-10-11 10:55:28,674 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 101 [2024-10-11 10:55:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:28,675 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-10-11 10:55:28,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 21 states have internal predecessors, (58), 9 states have call successors, (46), 4 states have call predecessors, (46), 7 states have return successors, (47), 5 states have call predecessors, (47), 9 states have call successors, (47) [2024-10-11 10:55:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2024-10-11 10:55:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 10:55:28,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:28,679 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:28,698 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:28,880 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:28,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:28,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash -661426845, now seen corresponding path program 1 times [2024-10-11 10:55:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908607419] [2024-10-11 10:55:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:55:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637940076] [2024-10-11 10:55:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:28,981 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:28,983 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:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:29,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 10:55:29,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 48 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-10-11 10:55:29,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:55:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 10:55:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:55:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908607419] [2024-10-11 10:55:29,915 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 10:55:29,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637940076] [2024-10-11 10:55:29,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637940076] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 10:55:29,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:55:29,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2024-10-11 10:55:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940414636] [2024-10-11 10:55:29,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:29,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:55:29,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:55:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:55:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:55:29,918 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:55:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:30,067 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2024-10-11 10:55:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:55:30,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-10-11 10:55:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:30,069 INFO L225 Difference]: With dead ends: 165 [2024-10-11 10:55:30,069 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 10:55:30,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:55:30,071 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 71 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:30,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 241 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:55:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 10:55:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 63. [2024-10-11 10:55:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:55:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2024-10-11 10:55:30,097 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 101 [2024-10-11 10:55:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:30,097 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2024-10-11 10:55:30,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:55:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2024-10-11 10:55:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 10:55:30,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:30,099 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:30,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 10:55:30,301 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:30,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1470773471, now seen corresponding path program 1 times [2024-10-11 10:55:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:55:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911647908] [2024-10-11 10:55:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:55:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:55:30,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149583903] [2024-10-11 10:55:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:30,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:30,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:30,375 INFO L229 MonitoredProcess]: Starting monitored process 4 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:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 10:55:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:55:30,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:55:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:55:30,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:55:30,659 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:55:30,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:55:30,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 10:55:30,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:55:30,868 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 10:55:30,951 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:55:30,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:55:30 BoogieIcfgContainer [2024-10-11 10:55:30,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:55:30,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:55:30,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:55:30,955 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:55:30,956 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:24" (3/4) ... [2024-10-11 10:55:30,961 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:55:30,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:55:30,964 INFO L158 Benchmark]: Toolchain (without parser) took 7120.54ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 125.0MB in the beginning and 79.0MB in the end (delta: 46.0MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-10-11 10:55:30,964 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:55:30,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.38ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 110.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:55:30,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.83ms. Allocated memory is still 161.5MB. Free memory was 110.5MB in the beginning and 107.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:55:30,966 INFO L158 Benchmark]: Boogie Preprocessor took 51.93ms. Allocated memory is still 161.5MB. Free memory was 107.2MB in the beginning and 104.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:55:30,966 INFO L158 Benchmark]: RCFGBuilder took 628.98ms. Allocated memory is still 161.5MB. Free memory was 104.1MB in the beginning and 115.1MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 10:55:30,967 INFO L158 Benchmark]: TraceAbstraction took 6026.53ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 114.1MB in the beginning and 79.0MB in the end (delta: 35.1MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2024-10-11 10:55:30,967 INFO L158 Benchmark]: Witness Printer took 7.85ms. Allocated memory is still 195.0MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:55:30,968 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.38ms. Allocated memory is still 161.5MB. Free memory was 125.0MB in the beginning and 110.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.83ms. Allocated memory is still 161.5MB. Free memory was 110.5MB in the beginning and 107.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.93ms. Allocated memory is still 161.5MB. Free memory was 107.2MB in the beginning and 104.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 628.98ms. Allocated memory is still 161.5MB. Free memory was 104.1MB in the beginning and 115.1MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6026.53ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 114.1MB in the beginning and 79.0MB in the end (delta: 35.1MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. * Witness Printer took 7.85ms. Allocated memory is still 195.0MB. Free memory was 79.0MB in the beginning and 79.0MB in the end (delta: 2.0kB). Peak memory consumption was 2.1MB. 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 91, overapproximation of bitwiseOr at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned short int var_1_3 = 100; [L25] unsigned char var_1_6 = 16; [L26] signed char var_1_7 = -25; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 25; [L29] signed char var_1_10 = -10; [L30] signed char var_1_11 = 0; [L31] signed long int var_1_12 = 25; [L32] unsigned long int var_1_13 = 2531521428; [L33] signed long int var_1_14 = -128; [L34] signed long int var_1_15 = 256; [L35] signed short int var_1_16 = -16; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=100, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=16, var_1_7=-25, var_1_8=16, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=16, var_1_9=25] [L72] var_1_8 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=25] [L73] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=25] [L74] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 31) VAL [isInitial=1, var_1_10=-10, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=25, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2531521428, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L84] var_1_13 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_13 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L86] RET assume_abort_if_not(var_1_13 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=-128, var_1_15=256, var_1_16=-16, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L39] var_1_14 = var_1_8 [L40] var_1_16 = var_1_14 [L41] signed long int stepLocal_0 = (((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)); VAL [isInitial=1, stepLocal_0=6, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=256, var_1_16=6, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=-25, var_1_8=6, var_1_9=0] [L42] COND FALSE !(var_1_2 <= stepLocal_0) [L45] var_1_7 = var_1_10 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=256, var_1_16=6, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L47] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L48] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=8, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L48] COND FALSE !(((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) [L51] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L53] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L54] COND TRUE 2.75f > var_1_12 [L55] var_1_11 = (var_1_10 + var_1_8) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=6, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (var_1_2 - var_1_3) ^ (var_1_15 * var_1_16) VAL [isInitial=1, var_1_10=0, var_1_11=6, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L91-L92] return ((((((((var_1_2 - var_1_3) ^ (var_1_15 * var_1_16)) <= -64) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_2 <= ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_7 == ((signed char) ((var_1_8 - (1 + var_1_9)) + var_1_10))) : (var_1_7 == ((signed char) var_1_10)))) && ((2.75f > var_1_12) ? (var_1_11 == ((signed char) (var_1_10 + var_1_8))) : (((var_1_13 - ((((var_1_14) > (var_1_8)) ? (var_1_14) : (var_1_8)))) > var_1_1) ? (var_1_11 == ((signed char) ((((((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) < (var_1_10)) ? (((((var_1_8) < ((1 + 5))) ? (var_1_8) : ((1 + 5))))) : (var_1_10))))) : 1))) && (var_1_14 == ((signed long int) var_1_8))) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_14)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=6, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=6, var_1_12=0, var_1_13=-2147483649, var_1_14=6, var_1_15=6, var_1_16=6, var_1_1=0, var_1_2=32767, var_1_3=32767, var_1_6=0, var_1_7=0, var_1_8=6, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 473 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 215 mSDtfsCounter, 473 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 707 NumberOfCodeBlocks, 707 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 600 ConstructedInterpolants, 1 QuantifiedInterpolants, 2692 SizeOfPredicates, 7 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 2622/2880 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:30,996 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-37.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 27e8564535ea94ba0a863541d1c14289d03df32702288432171c1c39cf06e605 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:55:33,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:55:33,394 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:33,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:55:33,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:55:33,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:55:33,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:55:33,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:55:33,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:55:33,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:55:33,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:55:33,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:55:33,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:55:33,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:55:33,450 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:55:33,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:55:33,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:55:33,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:55:33,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:55:33,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:55:33,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:55:33,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:55:33,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:55:33,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:55:33,457 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:55:33,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:55:33,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:55:33,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:55:33,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:55:33,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:55:33,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:55:33,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:55:33,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:55:33,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:55:33,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:33,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:55:33,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:55:33,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:55:33,463 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:55:33,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:55:33,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:55:33,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:55:33,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:55:33,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:55:33,464 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:55:33,465 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 -> 27e8564535ea94ba0a863541d1c14289d03df32702288432171c1c39cf06e605 [2024-10-11 10:55:33,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:55:33,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:55:33,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:55:33,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:55:33,841 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:55:33,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-37.i [2024-10-11 10:55:35,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:55:35,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:55:35,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-37.i [2024-10-11 10:55:35,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9ff5aa89b/26926fb99c144e498109ccea5d11fb61/FLAG540b24c62 [2024-10-11 10:55:36,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9ff5aa89b/26926fb99c144e498109ccea5d11fb61 [2024-10-11 10:55:36,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:55:36,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:55:36,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:36,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:55:36,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:55:36,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:36" (1/1) ... [2024-10-11 10:55:36,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cfaaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:36, skipping insertion in model container [2024-10-11 10:55:36,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:55:36" (1/1) ... [2024-10-11 10:55:36,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:55:36,281 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-37.i[916,929] [2024-10-11 10:55:36,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:36,367 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:55:36,378 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-37.i[916,929] [2024-10-11 10:55:36,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:55:36,434 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:55:36,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:36 WrapperNode [2024-10-11 10:55:36,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:55:36,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:36,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:55:36,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:55:36,443 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:36" (1/1) ... [2024-10-11 10:55:36,460 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:36" (1/1) ... [2024-10-11 10:55:36,493 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-10-11 10:55:36,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:55:36,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:55:36,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:55:36,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:55:36,510 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:36" (1/1) ... [2024-10-11 10:55:36,511 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:36" (1/1) ... [2024-10-11 10:55:36,513 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:36" (1/1) ... [2024-10-11 10:55:36,531 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:36,535 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:36" (1/1) ... [2024-10-11 10:55:36,536 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:36" (1/1) ... [2024-10-11 10:55:36,545 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:36" (1/1) ... [2024-10-11 10:55:36,551 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:36" (1/1) ... [2024-10-11 10:55:36,553 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:36" (1/1) ... [2024-10-11 10:55:36,573 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:36" (1/1) ... [2024-10-11 10:55:36,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:55:36,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:55:36,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:55:36,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:55:36,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:36" (1/1) ... [2024-10-11 10:55:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:55:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:55:36,618 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:36,624 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:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:55:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:55:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:55:36,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:55:36,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:55:36,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:55:36,774 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:55:36,776 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:55:37,396 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:55:37,397 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:55:37,461 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:55:37,462 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:55:37,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:37 BoogieIcfgContainer [2024-10-11 10:55:37,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:55:37,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:55:37,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:55:37,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:55:37,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:55:36" (1/3) ... [2024-10-11 10:55:37,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91bc95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:37, skipping insertion in model container [2024-10-11 10:55:37,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:55:36" (2/3) ... [2024-10-11 10:55:37,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91bc95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:55:37, skipping insertion in model container [2024-10-11 10:55:37,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:55:37" (3/3) ... [2024-10-11 10:55:37,474 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-37.i [2024-10-11 10:55:37,494 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:55:37,494 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:55:37,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:55:37,573 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;@778d2f56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:55:37,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:55:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:55:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:55:37,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:37,589 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:37,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:37,596 INFO L85 PathProgramCache]: Analyzing trace with hash 208737381, now seen corresponding path program 1 times [2024-10-11 10:55:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:55:37,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578590576] [2024-10-11 10:55:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:37,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:55:37,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:55:37,611 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:37,614 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:55:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:37,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:55:37,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-11 10:55:37,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:55:37,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:55:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578590576] [2024-10-11 10:55:37,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578590576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:55:37,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:55:37,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:55:37,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719500527] [2024-10-11 10:55:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:55:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:55:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:55:37,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:55:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:55:37,895 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:55:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:38,010 INFO L93 Difference]: Finished difference Result 83 states and 144 transitions. [2024-10-11 10:55:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:55:38,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-11 10:55:38,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:38,024 INFO L225 Difference]: With dead ends: 83 [2024-10-11 10:55:38,024 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 10:55:38,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:38,030 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:38,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:55:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 10:55:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 10:55:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:55:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-11 10:55:38,079 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 98 [2024-10-11 10:55:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:38,080 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-11 10:55:38,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 10:55:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-11 10:55:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:55:38,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:38,086 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:38,093 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 (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:55:38,286 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:55:38,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:38,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:38,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2113811557, now seen corresponding path program 1 times [2024-10-11 10:55:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:55:38,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768175975] [2024-10-11 10:55:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:38,289 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:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:55:38,291 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:55:38,293 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:55:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:38,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:55:38,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 222 proven. 69 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-11 10:55:39,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:55:39,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:55:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768175975] [2024-10-11 10:55:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768175975] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:55:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [443318004] [2024-10-11 10:55:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:39,573 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:55:39,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:55:39,576 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:55:39,578 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:55:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:39,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 10:55:39,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 222 proven. 69 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-11 10:55:40,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:55:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [443318004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:55:40,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:55:40,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-11 10:55:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105291422] [2024-10-11 10:55:40,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:55:40,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:55:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:55:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:55:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:55:40,383 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 10:55:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:55:41,237 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2024-10-11 10:55:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 10:55:41,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 98 [2024-10-11 10:55:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:55:41,240 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:55:41,240 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 10:55:41,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-10-11 10:55:41,242 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 10:55:41,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 10:55:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 10:55:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-11 10:55:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:55:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2024-10-11 10:55:41,256 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 98 [2024-10-11 10:55:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:55:41,257 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2024-10-11 10:55:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-11 10:55:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2024-10-11 10:55:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 10:55:41,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:55:41,260 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:55:41,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 10:55:41,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-10-11 10:55:41,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 10:55:41,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:55:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:55:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1304464931, now seen corresponding path program 1 times [2024-10-11 10:55:41,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:55:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289652822] [2024-10-11 10:55:41,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:41,669 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:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:55:41,673 INFO L229 MonitoredProcess]: Starting monitored process 5 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:41,676 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 (5)] Waiting until timeout for monitored process [2024-10-11 10:55:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:41,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 10:55:41,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 242 proven. 114 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 10:55:42,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:55:47,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:55:47,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289652822] [2024-10-11 10:55:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289652822] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:55:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [819411928] [2024-10-11 10:55:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:55:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:55:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:55:47,125 INFO L229 MonitoredProcess]: Starting monitored process 6 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:55:47,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 10:55:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:55:47,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 10:55:47,690 INFO L278 TraceCheckSpWp]: Computing forward predicates...