./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-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:06:24,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:06:24,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:06:24,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:06:24,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:06:24,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:06:24,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:06:24,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:06:24,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:06:24,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:06:24,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:06:24,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:06:24,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:06:24,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:06:24,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:06:24,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:06:24,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:06:24,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:06:24,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:06:24,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:06:24,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:06:24,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:06:24,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:06:24,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:06:24,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:06:24,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:06:24,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:06:24,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:06:24,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:06:24,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:06:24,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:06:24,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:06:24,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:06:24,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:06:24,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:06:24,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:06:24,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:06:24,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:06:24,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:06:24,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:06:24,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:06:24,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:06:24,171 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-11-20 06:06:24,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:06:24,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:06:24,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:06:24,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:06:24,487 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:06:24,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-20 06:06:25,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:06:26,132 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:06:26,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-20 06:06:26,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eee68e3c/456ad7af06704815be14954c0b44f713/FLAG2bb01c7cc [2024-11-20 06:06:26,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eee68e3c/456ad7af06704815be14954c0b44f713 [2024-11-20 06:06:26,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:06:26,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:06:26,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:06:26,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:06:26,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:06:26,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edf862f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26, skipping insertion in model container [2024-11-20 06:06:26,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:06:26,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-20 06:06:26,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:06:26,782 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:06:26,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-20 06:06:26,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:06:26,824 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:06:26,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26 WrapperNode [2024-11-20 06:06:26,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:06:26,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:06:26,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:06:26,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:06:26,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,867 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-20 06:06:26,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:06:26,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:06:26,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:06:26,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:06:26,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,901 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:06:26,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:06:26,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:06:26,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:06:26,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:06:26,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (1/1) ... [2024-11-20 06:06:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:06:26,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:06:27,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:06:27,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:06:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:06:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:06:27,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:06:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:06:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:06:27,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:06:27,129 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:06:27,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:06:27,390 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 06:06:27,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:06:27,409 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:06:27,410 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:06:27,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:27 BoogieIcfgContainer [2024-11-20 06:06:27,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:06:27,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:06:27,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:06:27,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:06:27,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:06:26" (1/3) ... [2024-11-20 06:06:27,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c03e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:27, skipping insertion in model container [2024-11-20 06:06:27,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:26" (2/3) ... [2024-11-20 06:06:27,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c03e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:27, skipping insertion in model container [2024-11-20 06:06:27,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:27" (3/3) ... [2024-11-20 06:06:27,420 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-20 06:06:27,436 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:06:27,437 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:06:27,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:06:27,514 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;@204295ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:06:27,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:06:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 06:06:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:06:27,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:06:27,532 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:06:27,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:06:27,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:06:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash 457138308, now seen corresponding path program 1 times [2024-11-20 06:06:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:06:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315285664] [2024-11-20 06:06:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:06:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:06:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:06:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:06:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:06:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:06:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:06:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:06:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:06:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:06:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:06:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:06:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:06:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:06:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:06:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 06:06:27,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:06:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315285664] [2024-11-20 06:06:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315285664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:06:27,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:06:27,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:06:27,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235704544] [2024-11-20 06:06:27,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:06:27,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:06:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:06:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:06:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:06:27,944 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 06:06:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:06:27,969 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-20 06:06:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:06:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-20 06:06:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:06:27,977 INFO L225 Difference]: With dead ends: 89 [2024-11-20 06:06:27,977 INFO L226 Difference]: Without dead ends: 44 [2024-11-20 06:06:27,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:06:27,986 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:06:27,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:06:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-20 06:06:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-20 06:06:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 06:06:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-20 06:06:28,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2024-11-20 06:06:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:06:28,039 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-20 06:06:28,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 06:06:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-20 06:06:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:06:28,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:06:28,045 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:06:28,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:06:28,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:06:28,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:06:28,048 INFO L85 PathProgramCache]: Analyzing trace with hash 279699268, now seen corresponding path program 1 times [2024-11-20 06:06:28,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:06:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463709729] [2024-11-20 06:06:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:28,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:06:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:06:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:06:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:06:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:06:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:06:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:06:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:06:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:06:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:06:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:06:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:06:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:06:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:06:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:06:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 06:06:28,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:06:28,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463709729] [2024-11-20 06:06:28,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463709729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:06:28,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:06:28,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:06:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969807148] [2024-11-20 06:06:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:06:28,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:06:28,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:06:28,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:06:28,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:06:28,541 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:06:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:06:28,623 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2024-11-20 06:06:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:06:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-20 06:06:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:06:28,627 INFO L225 Difference]: With dead ends: 126 [2024-11-20 06:06:28,627 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 06:06:28,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:06:28,628 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:06:28,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:06:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 06:06:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-20 06:06:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:06:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-20 06:06:28,658 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 92 [2024-11-20 06:06:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:06:28,659 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-20 06:06:28,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:06:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-20 06:06:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:06:28,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:06:28,663 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:06:28,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:06:28,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:06:28,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:06:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 281546310, now seen corresponding path program 1 times [2024-11-20 06:06:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:06:28,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537053063] [2024-11-20 06:06:28,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:06:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:06:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:06:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:06:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:06:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:06:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:06:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:06:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:06:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:06:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:06:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:06:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:06:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:06:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:06:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 06:06:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:06:30,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537053063] [2024-11-20 06:06:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537053063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:06:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:06:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 06:06:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306042449] [2024-11-20 06:06:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:06:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:06:30,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:06:30,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:06:30,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:06:30,269 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:06:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:06:30,793 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2024-11-20 06:06:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 06:06:30,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-20 06:06:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:06:30,798 INFO L225 Difference]: With dead ends: 159 [2024-11-20 06:06:30,798 INFO L226 Difference]: Without dead ends: 157 [2024-11-20 06:06:30,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-20 06:06:30,799 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 149 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:06:30,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 400 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:06:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-20 06:06:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 129. [2024-11-20 06:06:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.170731707317073) internal successors, (96), 84 states have internal predecessors, (96), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 06:06:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-11-20 06:06:30,850 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 92 [2024-11-20 06:06:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:06:30,850 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-11-20 06:06:30,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:06:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-11-20 06:06:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:06:30,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:06:30,853 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:06:30,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:06:30,853 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:06:30,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:06:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash -111480700, now seen corresponding path program 1 times [2024-11-20 06:06:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:06:30,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915095826] [2024-11-20 06:06:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:06:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:06:30,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:06:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:06:30,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:06:30,955 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:06:30,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:06:30,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:06:30,963 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 06:06:31,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:06:31,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:06:31 BoogieIcfgContainer [2024-11-20 06:06:31,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:06:31,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:06:31,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:06:31,056 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:06:31,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:27" (3/4) ... [2024-11-20 06:06:31,059 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:06:31,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:06:31,061 INFO L158 Benchmark]: Toolchain (without parser) took 4539.54ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 112.0MB in the beginning and 89.8MB in the end (delta: 22.3MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-11-20 06:06:31,062 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:06:31,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.51ms. Allocated memory is still 178.3MB. Free memory was 111.8MB in the beginning and 98.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:06:31,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.26ms. Allocated memory is still 178.3MB. Free memory was 98.0MB in the beginning and 95.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:06:31,065 INFO L158 Benchmark]: Boogie Preprocessor took 46.33ms. Allocated memory is still 178.3MB. Free memory was 95.7MB in the beginning and 93.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:06:31,066 INFO L158 Benchmark]: RCFGBuilder took 492.71ms. Allocated memory is still 178.3MB. Free memory was 93.1MB in the beginning and 135.8MB in the end (delta: -42.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-20 06:06:31,066 INFO L158 Benchmark]: TraceAbstraction took 3642.62ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 135.1MB in the beginning and 90.8MB in the end (delta: 44.3MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2024-11-20 06:06:31,066 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 220.2MB. Free memory was 90.8MB in the beginning and 89.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:06:31,068 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.18ms. Allocated memory is still 104.9MB. Free memory is still 76.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.51ms. Allocated memory is still 178.3MB. Free memory was 111.8MB in the beginning and 98.0MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.26ms. Allocated memory is still 178.3MB. Free memory was 98.0MB in the beginning and 95.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.33ms. Allocated memory is still 178.3MB. Free memory was 95.7MB in the beginning and 93.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.71ms. Allocated memory is still 178.3MB. Free memory was 93.1MB in the beginning and 135.8MB in the end (delta: -42.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3642.62ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 135.1MB in the beginning and 90.8MB in the end (delta: 44.3MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 220.2MB. Free memory was 90.8MB in the beginning and 89.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_9 = 100; [L26] signed long int var_1_10 = 4; [L27] signed long int var_1_11 = 128; [L28] signed long int var_1_12 = 128; [L29] signed long int var_1_13 = 0; [L30] signed long int var_1_14 = 127; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_9=100] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=100] [L67] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L67] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=100] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=100] [L70] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L70] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L71] var_1_10 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L72] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L73] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=128, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L74] var_1_11 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L75] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L76] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=0, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L77] var_1_13 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_13 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L78] RET assume_abort_if_not(var_1_13 >= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L79] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=127, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L80] var_1_14 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L82] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L83] var_1_16 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L84] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L85] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L98] RET updateVariables() [L99] CALL step() [L36] COND FALSE !(0.8f > (- var_1_10)) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L39] unsigned char stepLocal_1 = var_1_15 > var_1_15; [L40] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-256, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L41] COND FALSE !(var_1_2 && stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=100] [L48] COND TRUE \read(var_1_2) [L49] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L57] signed long int stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-200, var_1_10=2147483646, var_1_11=2147483646, var_1_12=128, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L58] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L61] var_1_12 = ((var_1_13 - var_1_14) - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_15 > var_1_15)) ? (var_1_1 == ((signed long int) (var_1_15 - var_1_15))) : (var_1_1 == ((signed long int) ((var_1_15 + 5) - var_1_15)))) : 1) && (var_1_2 ? (var_1_9 == ((signed long int) (var_1_10 - var_1_11))) : ((var_1_1 < var_1_15) ? (var_1_9 == ((signed long int) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))) : (var_1_9 == ((signed long int) var_1_10))))) && ((var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (var_1_12 == ((signed long int) (var_1_10 - 99.5))) : (var_1_12 == ((signed long int) ((var_1_13 - var_1_14) - var_1_11))))) && ((0.8f > (- var_1_10)) ? (var_1_15 == ((unsigned char) var_1_16)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483646, var_1_11=2147483646, var_1_12=1, var_1_13=2147483647, var_1_14=0, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 633 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 422 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 211 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:06:31,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:06:33,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:06:33,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:06:33,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:06:33,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:06:33,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:06:33,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:06:33,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:06:33,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:06:33,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:06:33,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:06:33,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:06:33,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:06:33,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:06:33,395 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:06:33,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:06:33,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:06:33,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:06:33,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:06:33,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:06:33,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:06:33,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:06:33,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:06:33,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:06:33,402 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:06:33,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:06:33,403 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:06:33,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:06:33,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:06:33,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:06:33,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:06:33,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:06:33,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:06:33,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:06:33,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:06:33,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:06:33,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:06:33,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:06:33,406 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:06:33,407 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:06:33,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:06:33,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:06:33,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:06:33,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:06:33,409 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e6bb6165a865ae599fbbbb878eea3788e6b54201c0af68fa4b08e901e99cc922 [2024-11-20 06:06:33,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:06:33,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:06:33,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:06:33,805 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:06:33,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:06:33,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-20 06:06:35,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:06:35,551 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:06:35,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-20 06:06:35,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ff70aac/92fbdea7b65b403d8568bad2ce957baf/FLAGfc893897f [2024-11-20 06:06:35,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ff70aac/92fbdea7b65b403d8568bad2ce957baf [2024-11-20 06:06:35,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:06:35,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:06:35,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:06:35,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:06:35,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:06:35,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:35,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aca6094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35, skipping insertion in model container [2024-11-20 06:06:35,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:35,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:06:35,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-20 06:06:35,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:06:35,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:06:35,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-78.i[916,929] [2024-11-20 06:06:35,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:06:35,970 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:06:35,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35 WrapperNode [2024-11-20 06:06:35,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:06:35,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:06:35,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:06:35,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:06:35,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:35,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,017 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-11-20 06:06:36,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:06:36,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:06:36,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:06:36,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:06:36,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,057 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:06:36,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:06:36,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:06:36,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:06:36,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:06:36,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (1/1) ... [2024-11-20 06:06:36,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:06:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:06:36,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:06:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:06:36,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:06:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:06:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:06:36,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:06:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:06:36,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:06:36,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:06:36,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:06:38,626 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 06:06:38,626 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:06:38,642 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:06:38,643 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:06:38,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:38 BoogieIcfgContainer [2024-11-20 06:06:38,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:06:38,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:06:38,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:06:38,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:06:38,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:06:35" (1/3) ... [2024-11-20 06:06:38,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13489c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:38, skipping insertion in model container [2024-11-20 06:06:38,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:35" (2/3) ... [2024-11-20 06:06:38,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13489c26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:38, skipping insertion in model container [2024-11-20 06:06:38,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:38" (3/3) ... [2024-11-20 06:06:38,652 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-78.i [2024-11-20 06:06:38,666 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:06:38,666 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:06:38,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:06:38,730 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;@35cf885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:06:38,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:06:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 06:06:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:06:38,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:06:38,749 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:06:38,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:06:38,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:06:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash 457138308, now seen corresponding path program 1 times [2024-11-20 06:06:38,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:06:38,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319780351] [2024-11-20 06:06:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:06:38,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:06:38,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:06:38,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:06:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:38,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:06:39,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:06:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-20 06:06:39,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:06:39,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:06:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319780351] [2024-11-20 06:06:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319780351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:06:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:06:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:06:39,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806691318] [2024-11-20 06:06:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:06:39,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:06:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:06:39,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:06:39,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:06:39,102 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 06:06:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:06:39,140 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-20 06:06:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:06:39,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-11-20 06:06:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:06:39,149 INFO L225 Difference]: With dead ends: 89 [2024-11-20 06:06:39,149 INFO L226 Difference]: Without dead ends: 44 [2024-11-20 06:06:39,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:06:39,154 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:06:39,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:06:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-20 06:06:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-20 06:06:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 06:06:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-20 06:06:39,190 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 92 [2024-11-20 06:06:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:06:39,191 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-20 06:06:39,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 06:06:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-20 06:06:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:06:39,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:06:39,195 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:06:39,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 06:06:39,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:06:39,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:06:39,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:06:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash 279699268, now seen corresponding path program 1 times [2024-11-20 06:06:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:06:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621506265] [2024-11-20 06:06:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:06:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:06:39,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:06:39,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:06:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:39,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 06:06:39,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:06:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 06:06:40,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:06:40,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:06:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621506265] [2024-11-20 06:06:40,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621506265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:06:40,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:06:40,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:06:40,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72834528] [2024-11-20 06:06:40,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:06:40,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:06:40,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:06:40,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:06:40,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:06:40,269 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:06:41,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:06:44,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:06:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:06:44,523 INFO L93 Difference]: Finished difference Result 126 states and 183 transitions. [2024-11-20 06:06:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:06:44,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-20 06:06:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:06:44,552 INFO L225 Difference]: With dead ends: 126 [2024-11-20 06:06:44,552 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 06:06:44,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:06:44,554 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:06:44,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 170 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-20 06:06:44,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 06:06:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-20 06:06:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:06:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-20 06:06:44,579 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 92 [2024-11-20 06:06:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:06:44,580 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-20 06:06:44,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:06:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-20 06:06:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:06:44,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:06:44,582 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:06:44,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 06:06:44,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:06:44,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:06:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:06:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 281546310, now seen corresponding path program 1 times [2024-11-20 06:06:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:06:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952298813] [2024-11-20 06:06:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:44,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:06:44,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:06:44,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:06:44,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 06:06:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:06:44,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:06:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:06:45,161 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-20 06:06:45,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [774887153] [2024-11-20 06:06:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:06:45,162 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:06:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:06:45,167 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 06:06:45,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 06:06:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:06:45,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 06:06:45,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:07:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 06:07:24,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:07:24,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:07:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952298813] [2024-11-20 06:07:24,265 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 06:07:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [774887153] [2024-11-20 06:07:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [774887153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:07:24,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:07:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:07:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412394134] [2024-11-20 06:07:24,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:07:24,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:07:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:07:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:07:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:07:24,268 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:07:33,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:07:36,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:07:41,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:07:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:07:45,597 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2024-11-20 06:07:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:07:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-20 06:07:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:07:45,603 INFO L225 Difference]: With dead ends: 127 [2024-11-20 06:07:45,603 INFO L226 Difference]: Without dead ends: 125 [2024-11-20 06:07:45,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:07:45,605 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 68 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:07:45,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 304 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 18.4s Time] [2024-11-20 06:07:45,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-20 06:07:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2024-11-20 06:07:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 80 states have internal predecessors, (92), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 06:07:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 160 transitions. [2024-11-20 06:07:45,633 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 160 transitions. Word has length 92 [2024-11-20 06:07:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:07:45,633 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 160 transitions. [2024-11-20 06:07:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-20 06:07:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2024-11-20 06:07:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 06:07:45,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:07:45,636 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:07:45,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 06:07:45,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-20 06:07:46,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 06:07:46,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:07:46,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:07:46,039 INFO L85 PathProgramCache]: Analyzing trace with hash -111480700, now seen corresponding path program 1 times [2024-11-20 06:07:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:07:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610214825] [2024-11-20 06:07:46,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:07:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:07:46,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:07:46,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:07:46,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 06:07:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:07:46,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 06:07:46,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:07:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-20 06:07:46,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:07:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-20 06:07:54,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:07:54,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610214825] [2024-11-20 06:07:54,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610214825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:07:54,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:07:54,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-20 06:07:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048319149] [2024-11-20 06:07:54,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:07:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:07:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:07:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:07:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:07:54,796 INFO L87 Difference]: Start difference. First operand 117 states and 160 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-20 06:07:57,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []