./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.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 aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:22:29,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:22:29,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:22:29,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:22:29,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:22:29,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:22:29,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:22:29,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:22:29,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:22:29,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:22:29,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:22:29,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:22:29,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:22:29,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:22:29,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:22:29,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:22:29,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:22:29,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:22:29,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:22:29,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:22:29,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:22:29,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:22:29,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:22:29,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:22:29,827 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:22:29,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:22:29,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:22:29,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:22:29,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:22:29,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:22:29,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:22:29,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:22:29,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:22:29,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:22:29,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:22:29,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:22:29,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:22:29,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:22:29,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:22:29,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:22:29,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:22:29,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:22:29,832 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 -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2024-11-12 05:22:30,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:22:30,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:22:30,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:22:30,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:22:30,114 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:22:30,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-11-12 05:22:31,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:22:31,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:22:31,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-11-12 05:22:31,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0ebce7f/3c75901a5f6a4e239ce911949acea862/FLAG53f830112 [2024-11-12 05:22:32,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b0ebce7f/3c75901a5f6a4e239ce911949acea862 [2024-11-12 05:22:32,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:22:32,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:22:32,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:22:32,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:22:32,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:22:32,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c40c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32, skipping insertion in model container [2024-11-12 05:22:32,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:22:32,477 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_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-11-12 05:22:32,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:22:32,552 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:22:32,566 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_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-11-12 05:22:32,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:22:32,613 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:22:32,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32 WrapperNode [2024-11-12 05:22:32,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:22:32,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:22:32,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:22:32,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:22:32,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,726 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-12 05:22:32,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:22:32,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:22:32,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:22:32,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:22:32,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,762 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-12 05:22:32,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:22:32,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:22:32,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:22:32,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:22:32,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (1/1) ... [2024-11-12 05:22:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:22:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:22:32,810 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-12 05:22:32,812 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-12 05:22:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:22:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:22:32,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:22:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:22:32,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:22:32,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:22:32,941 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:22:32,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:22:33,144 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 05:22:33,144 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:22:33,159 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:22:33,160 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:22:33,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:22:33 BoogieIcfgContainer [2024-11-12 05:22:33,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:22:33,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:22:33,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:22:33,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:22:33,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:22:32" (1/3) ... [2024-11-12 05:22:33,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515ea418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:22:33, skipping insertion in model container [2024-11-12 05:22:33,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:32" (2/3) ... [2024-11-12 05:22:33,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515ea418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:22:33, skipping insertion in model container [2024-11-12 05:22:33,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:22:33" (3/3) ... [2024-11-12 05:22:33,169 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-11-12 05:22:33,187 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:22:33,187 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:22:33,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:22:33,270 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;@1af9bb47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:22:33,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:22:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 05:22:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 05:22:33,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:22:33,287 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-12 05:22:33,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:22:33,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:22:33,294 INFO L85 PathProgramCache]: Analyzing trace with hash 921321659, now seen corresponding path program 1 times [2024-11-12 05:22:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:22:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438215819] [2024-11-12 05:22:33,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:22:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:22:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:22:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 05:22:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 05:22:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 05:22:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 05:22:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 05:22:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 05:22:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:22:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438215819] [2024-11-12 05:22:33,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438215819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:22:33,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:22:33,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:22:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780978418] [2024-11-12 05:22:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:22:33,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:22:33,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:22:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:22:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:22:33,635 INFO L87 Difference]: Start difference. First operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 05:22:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:22:33,659 INFO L93 Difference]: Finished difference Result 74 states and 107 transitions. [2024-11-12 05:22:33,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:22:33,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-12 05:22:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:22:33,670 INFO L225 Difference]: With dead ends: 74 [2024-11-12 05:22:33,671 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 05:22:33,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-12 05:22:33,680 INFO L435 NwaCegarLoop]: 47 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, 47 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-12 05:22:33,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:22:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 05:22:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 05:22:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 05:22:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-12 05:22:33,717 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 49 [2024-11-12 05:22:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:22:33,718 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-12 05:22:33,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 05:22:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-12 05:22:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 05:22:33,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:22:33,720 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-12 05:22:33,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:22:33,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:22:33,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:22:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1072259153, now seen corresponding path program 1 times [2024-11-12 05:22:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:22:33,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069751256] [2024-11-12 05:22:33,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:22:33,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:22:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:22:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 05:22:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 05:22:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 05:22:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 05:22:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 05:22:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 05:22:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:22:34,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069751256] [2024-11-12 05:22:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069751256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:22:34,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:22:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:22:34,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772828809] [2024-11-12 05:22:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:22:34,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:22:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:22:34,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:22:34,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:22:34,009 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:22:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:22:34,037 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-11-12 05:22:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:22:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-12 05:22:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:22:34,039 INFO L225 Difference]: With dead ends: 65 [2024-11-12 05:22:34,039 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 05:22:34,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:22:34,041 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:22:34,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:22:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 05:22:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 05:22:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 05:22:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-12 05:22:34,055 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 49 [2024-11-12 05:22:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:22:34,057 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-12 05:22:34,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:22:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-12 05:22:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 05:22:34,059 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:22:34,060 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:22:34,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:22:34,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:22:34,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:22:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1945078630, now seen corresponding path program 1 times [2024-11-12 05:22:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:22:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584648370] [2024-11-12 05:22:34,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:22:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:22:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:22:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 05:22:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 05:22:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 05:22:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 05:22:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 05:22:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 05:22:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:22:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584648370] [2024-11-12 05:22:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584648370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:22:34,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:22:34,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:22:34,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913121146] [2024-11-12 05:22:34,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:22:34,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:22:34,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:22:34,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:22:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:22:34,209 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:22:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:22:34,234 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-11-12 05:22:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:22:34,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-11-12 05:22:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:22:34,237 INFO L225 Difference]: With dead ends: 65 [2024-11-12 05:22:34,237 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 05:22:34,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:22:34,240 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:22:34,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:22:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 05:22:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 05:22:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 05:22:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-12 05:22:34,248 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 50 [2024-11-12 05:22:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:22:34,249 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-12 05:22:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:22:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-12 05:22:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 05:22:34,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:22:34,251 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:22:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:22:34,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:22:34,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:22:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1943231588, now seen corresponding path program 1 times [2024-11-12 05:22:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:22:34,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468006513] [2024-11-12 05:22:34,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:22:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:22:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:22:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 05:22:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 05:22:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 05:22:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 05:22:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 05:22:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 05:22:34,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:22:34,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468006513] [2024-11-12 05:22:34,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468006513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:22:34,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:22:34,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:22:34,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781780973] [2024-11-12 05:22:34,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:22:34,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:22:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:22:34,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:22:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:22:34,449 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:22:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:22:34,541 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2024-11-12 05:22:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:22:34,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-11-12 05:22:34,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:22:34,543 INFO L225 Difference]: With dead ends: 106 [2024-11-12 05:22:34,543 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 05:22:34,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-12 05:22:34,545 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 43 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:22:34,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 115 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:22:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 05:22:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2024-11-12 05:22:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 05:22:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-11-12 05:22:34,558 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 50 [2024-11-12 05:22:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:22:34,559 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-12 05:22:34,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:22:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2024-11-12 05:22:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 05:22:34,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:22:34,561 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:22:34,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:22:34,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:22:34,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:22:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash -588246093, now seen corresponding path program 1 times [2024-11-12 05:22:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:22:34,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905078273] [2024-11-12 05:22:34,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:22:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:22:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:22:34,606 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:22:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:22:34,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:22:34,678 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:22:34,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:22:34,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:22:34,683 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 05:22:34,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:22:34,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:22:34 BoogieIcfgContainer [2024-11-12 05:22:34,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:22:34,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:22:34,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:22:34,749 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:22:34,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:22:33" (3/4) ... [2024-11-12 05:22:34,752 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:22:34,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:22:34,755 INFO L158 Benchmark]: Toolchain (without parser) took 2483.95ms. Allocated memory is still 169.9MB. Free memory was 99.1MB in the beginning and 79.2MB in the end (delta: 19.8MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-12 05:22:34,756 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:22:34,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.90ms. Allocated memory is still 169.9MB. Free memory was 98.9MB in the beginning and 85.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 05:22:34,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.17ms. Allocated memory is still 169.9MB. Free memory was 85.1MB in the beginning and 140.2MB in the end (delta: -55.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:22:34,758 INFO L158 Benchmark]: Boogie Preprocessor took 49.27ms. Allocated memory is still 169.9MB. Free memory was 140.2MB in the beginning and 138.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:22:34,758 INFO L158 Benchmark]: RCFGBuilder took 383.27ms. Allocated memory is still 169.9MB. Free memory was 138.1MB in the beginning and 124.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 05:22:34,758 INFO L158 Benchmark]: TraceAbstraction took 1585.16ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 80.3MB in the end (delta: 43.8MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-11-12 05:22:34,758 INFO L158 Benchmark]: Witness Printer took 5.91ms. Allocated memory is still 169.9MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:22:34,760 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.20ms. Allocated memory is still 117.4MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.90ms. Allocated memory is still 169.9MB. Free memory was 98.9MB in the beginning and 85.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.17ms. Allocated memory is still 169.9MB. Free memory was 85.1MB in the beginning and 140.2MB in the end (delta: -55.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.27ms. Allocated memory is still 169.9MB. Free memory was 140.2MB in the beginning and 138.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.27ms. Allocated memory is still 169.9MB. Free memory was 138.1MB in the beginning and 124.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1585.16ms. Allocated memory is still 169.9MB. Free memory was 124.0MB in the beginning and 80.3MB in the end (delta: 43.8MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 5.91ms. Allocated memory is still 169.9MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.6; [L23] double var_1_2 = 64.25; [L24] double var_1_3 = 31.2; [L25] signed long int var_1_4 = 1; [L26] float var_1_7 = 100.5; [L27] float var_1_9 = 50.2; [L28] float var_1_10 = 0.125; [L29] float var_1_11 = 9999999999999.8; [L30] float var_1_12 = 3.5; [L31] unsigned short int var_1_13 = 0; [L32] double last_1_var_1_1 = 9999.6; [L33] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L82] isInitial = 1 [L83] FCALL initially() [L84] int k_loop; [L85] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L85] COND TRUE k_loop < 1 [L86] CALL updateLastVariables() [L74] last_1_var_1_1 = var_1_1 [L75] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L86] RET updateLastVariables() [L87] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L64] var_1_9 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L65] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L66] var_1_10 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L67] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L68] var_1_11 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L69] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L70] var_1_12 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L71] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L87] RET updateVariables() [L88] CALL step() [L37] COND TRUE (- last_1_var_1_13) >= last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L38] COND FALSE !(last_1_var_1_13 > last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L46] COND TRUE -4 < var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L47] COND TRUE var_1_11 <= (24.6f * var_1_9) [L48] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=1, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L51] var_1_1 = (var_1_2 - var_1_3) [L52] signed long int stepLocal_0 = var_1_13 + var_1_4; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_13=1, var_1_4=1, var_1_7=201/2] [L53] COND FALSE !(stepLocal_0 < var_1_4) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L88] RET step() [L89] CALL, EXPR property() [L78-L79] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && (((- last_1_var_1_13) >= last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? ((var_1_3 == last_1_var_1_1) ? (var_1_4 == ((signed long int) last_1_var_1_13)) : (var_1_4 == ((signed long int) last_1_var_1_13))) : 1) : 1)) && (((var_1_13 + var_1_4) < var_1_4) ? (var_1_7 == ((float) (((((var_1_3 - (var_1_9 + var_1_10))) < ((var_1_11 + var_1_12))) ? ((var_1_3 - (var_1_9 + var_1_10))) : ((var_1_11 + var_1_12)))))) : (var_1_7 == ((float) var_1_11)))) && ((-4 < var_1_4) ? ((var_1_11 <= (24.6f * var_1_9)) ? (var_1_13 == ((unsigned short int) var_1_4)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L89] RET, EXPR property() [L89] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 169 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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-12 05:22:34,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.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 aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:22:37,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:22:37,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:22:37,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:22:37,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:22:37,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:22:37,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:22:37,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:22:37,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:22:37,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:22:37,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:22:37,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:22:37,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:22:37,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:22:37,139 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:22:37,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:22:37,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:22:37,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:22:37,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:22:37,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:22:37,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:22:37,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:22:37,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:22:37,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:22:37,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:22:37,147 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:22:37,147 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:22:37,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:22:37,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:22:37,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:22:37,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:22:37,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:22:37,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:22:37,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:22:37,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:22:37,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:22:37,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:22:37,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:22:37,150 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:22:37,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:22:37,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:22:37,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:22:37,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:22:37,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:22:37,154 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 -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2024-11-12 05:22:37,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:22:37,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:22:37,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:22:37,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:22:37,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:22:37,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-11-12 05:22:39,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:22:39,317 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:22:39,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-11-12 05:22:39,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d770e78/40b327921cea4f8c817afba493160a1e/FLAG6cd45f37c [2024-11-12 05:22:39,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d770e78/40b327921cea4f8c817afba493160a1e [2024-11-12 05:22:39,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:22:39,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:22:39,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:22:39,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:22:39,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:22:39,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c525525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39, skipping insertion in model container [2024-11-12 05:22:39,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:22:39,572 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_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-11-12 05:22:39,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:22:39,645 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:22:39,665 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_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-11-12 05:22:39,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:22:39,710 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:22:39,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39 WrapperNode [2024-11-12 05:22:39,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:22:39,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:22:39,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:22:39,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:22:39,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,764 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-12 05:22:39,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:22:39,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:22:39,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:22:39,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:22:39,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,794 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-12 05:22:39,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:22:39,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:22:39,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:22:39,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:22:39,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (1/1) ... [2024-11-12 05:22:39,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:22:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:22:39,851 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-12 05:22:39,852 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-12 05:22:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:22:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:22:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:22:39,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:22:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:22:39,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:22:39,960 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:22:39,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:22:47,199 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-12 05:22:47,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:22:47,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:22:47,210 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:22:47,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:22:47 BoogieIcfgContainer [2024-11-12 05:22:47,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:22:47,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:22:47,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:22:47,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:22:47,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:22:39" (1/3) ... [2024-11-12 05:22:47,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f5d927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:22:47, skipping insertion in model container [2024-11-12 05:22:47,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:22:39" (2/3) ... [2024-11-12 05:22:47,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f5d927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:22:47, skipping insertion in model container [2024-11-12 05:22:47,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:22:47" (3/3) ... [2024-11-12 05:22:47,219 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-11-12 05:22:47,235 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:22:47,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:22:47,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:22:47,298 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;@11ad98b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:22:47,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:22:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 05:22:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 05:22:47,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:22:47,312 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-12 05:22:47,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:22:47,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:22:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 921321659, now seen corresponding path program 1 times [2024-11-12 05:22:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:22:47,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703563963] [2024-11-12 05:22:47,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:22:47,339 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-12 05:22:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:22:47,341 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-12 05:22:47,344 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-12 05:22:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:47,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:22:47,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:22:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-12 05:22:47,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:22:47,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:22:47,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703563963] [2024-11-12 05:22:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703563963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:22:47,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:22:47,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:22:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188055289] [2024-11-12 05:22:47,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:22:47,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:22:47,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:22:47,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:22:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:22:47,805 INFO L87 Difference]: Start difference. First operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 05:22:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:22:47,822 INFO L93 Difference]: Finished difference Result 74 states and 107 transitions. [2024-11-12 05:22:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:22:47,825 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 49 [2024-11-12 05:22:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:22:47,829 INFO L225 Difference]: With dead ends: 74 [2024-11-12 05:22:47,830 INFO L226 Difference]: Without dead ends: 34 [2024-11-12 05:22:47,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-12 05:22:47,835 INFO L435 NwaCegarLoop]: 47 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, 47 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-12 05:22:47,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:22:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-12 05:22:47,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-12 05:22:47,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 05:22:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-12 05:22:47,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 49 [2024-11-12 05:22:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:22:47,866 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-12 05:22:47,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 05:22:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-12 05:22:47,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 05:22:47,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:22:47,870 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 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-12 05:22:47,884 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-12 05:22:48,071 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-12 05:22:48,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:22:48,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:22:48,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1072259153, now seen corresponding path program 1 times [2024-11-12 05:22:48,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:22:48,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551092436] [2024-11-12 05:22:48,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:22:48,074 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-12 05:22:48,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:22:48,075 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-12 05:22:48,076 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-12 05:22:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:22:48,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 05:22:48,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:22:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 05:22:48,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:22:48,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:22:48,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551092436] [2024-11-12 05:22:48,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551092436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:22:48,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:22:48,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:22:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848359366] [2024-11-12 05:22:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:22:48,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:22:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:22:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:22:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:22:48,956 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:22:53,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:22:57,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:01,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:01,940 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2024-11-12 05:23:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:23:01,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-11-12 05:23:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:01,976 INFO L225 Difference]: With dead ends: 108 [2024-11-12 05:23:01,977 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 05:23:01,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:23:01,978 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:23:01,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 111 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2024-11-12 05:23:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 05:23:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2024-11-12 05:23:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 05:23:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-12 05:23:02,005 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 49 [2024-11-12 05:23:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:02,005 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-12 05:23:02,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:23:02,006 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-12 05:23:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-12 05:23:02,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:02,009 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:23:02,024 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-12 05:23:02,209 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-12 05:23:02,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:02,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1582739272, now seen corresponding path program 1 times [2024-11-12 05:23:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:23:02,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525450002] [2024-11-12 05:23:02,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:02,211 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-12 05:23:02,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:23:02,214 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-12 05:23:02,215 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-12 05:23:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:02,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 05:23:02,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:23:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 05:23:02,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:23:02,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:23:02,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525450002] [2024-11-12 05:23:02,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525450002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:23:02,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:23:02,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:23:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654193489] [2024-11-12 05:23:02,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:23:02,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:23:02,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:23:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:23:02,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:23:02,970 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:23:06,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:10,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:10,559 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions. [2024-11-12 05:23:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:23:10,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2024-11-12 05:23:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:10,595 INFO L225 Difference]: With dead ends: 123 [2024-11-12 05:23:10,595 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 05:23:10,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:23:10,597 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-12 05:23:10,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-12 05:23:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 05:23:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-12 05:23:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 05:23:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 79 transitions. [2024-11-12 05:23:10,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 79 transitions. Word has length 50 [2024-11-12 05:23:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:10,610 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 79 transitions. [2024-11-12 05:23:10,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:23:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 79 transitions. [2024-11-12 05:23:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 05:23:10,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:10,612 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:23:10,629 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-12 05:23:10,812 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 [2024-11-12 05:23:10,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:10,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash -590093135, now seen corresponding path program 1 times [2024-11-12 05:23:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:23:10,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387251458] [2024-11-12 05:23:10,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:10,815 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-12 05:23:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:23:10,818 INFO L229 MonitoredProcess]: Starting monitored process 5 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-12 05:23:10,819 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 (5)] Waiting until timeout for monitored process [2024-11-12 05:23:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:11,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:23:11,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:23:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-12 05:23:11,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:23:11,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:23:11,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387251458] [2024-11-12 05:23:11,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387251458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:23:11,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:23:11,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:23:11,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560739628] [2024-11-12 05:23:11,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:23:11,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:23:11,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:23:11,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:23:11,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:23:11,750 INFO L87 Difference]: Start difference. First operand 63 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:23:16,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:20,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:24,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:28,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:32,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:36,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:23:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:23:36,872 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2024-11-12 05:23:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:23:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2024-11-12 05:23:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:23:36,879 INFO L225 Difference]: With dead ends: 96 [2024-11-12 05:23:36,879 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 05:23:36,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:23:36,881 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:23:36,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 25.1s Time] [2024-11-12 05:23:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 05:23:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-12 05:23:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 05:23:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-11-12 05:23:36,895 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 51 [2024-11-12 05:23:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:23:36,895 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-11-12 05:23:36,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 05:23:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-11-12 05:23:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 05:23:36,897 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:23:36,897 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:23:36,915 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 05:23:37,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-12 05:23:37,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:23:37,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:23:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -588246093, now seen corresponding path program 1 times [2024-11-12 05:23:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:23:37,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247426226] [2024-11-12 05:23:37,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:23:37,104 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-12 05:23:37,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:23:37,106 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-12 05:23:37,107 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-12 05:23:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:23:37,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 05:23:37,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:24:03,544 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)