./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.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 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:46:37,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:46:37,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:46:37,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:46:37,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:46:38,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:46:38,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:46:38,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:46:38,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:46:38,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:46:38,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:46:38,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:46:38,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:46:38,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:46:38,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:46:38,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:46:38,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:46:38,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:46:38,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:46:38,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:46:38,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:46:38,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:46:38,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:46:38,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:46:38,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:46:38,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:46:38,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:46:38,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:46:38,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:46:38,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:46:38,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:46:38,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:46:38,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:46:38,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:46:38,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:46:38,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:46:38,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:46:38,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:46:38,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:46:38,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:46:38,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:46:38,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:46:38,034 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 -> 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c [2024-11-08 23:46:38,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:46:38,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:46:38,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:46:38,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:46:38,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:46:38,399 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-85.i [2024-11-08 23:46:39,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:46:40,070 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:46:40,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2024-11-08 23:46:40,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f60d220/c94f05cf07ad486b8ff2c958d2aecc65/FLAG896a53198 [2024-11-08 23:46:40,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f60d220/c94f05cf07ad486b8ff2c958d2aecc65 [2024-11-08 23:46:40,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:46:40,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:46:40,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:40,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:46:40,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:46:40,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2248b287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40, skipping insertion in model container [2024-11-08 23:46:40,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:46:40,643 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-85.i[915,928] [2024-11-08 23:46:40,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:40,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:46:40,735 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-85.i[915,928] [2024-11-08 23:46:40,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:40,791 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:46:40,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40 WrapperNode [2024-11-08 23:46:40,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:40,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:40,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:46:40,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:46:40,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,845 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-11-08 23:46:40,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:40,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:46:40,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:46:40,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:46:40,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:46:40,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:46:40,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:46:40,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:46:40,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:46:40,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (1/1) ... [2024-11-08 23:46:40,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:46:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:46:40,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:46:40,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:46:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:46:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:46:41,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:46:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:46:41,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:46:41,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:46:41,102 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:46:41,107 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:46:41,366 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 23:46:41,367 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:46:41,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:46:41,378 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:46:41,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:41 BoogieIcfgContainer [2024-11-08 23:46:41,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:46:41,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:46:41,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:46:41,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:46:41,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:46:40" (1/3) ... [2024-11-08 23:46:41,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b67415e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:41, skipping insertion in model container [2024-11-08 23:46:41,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:40" (2/3) ... [2024-11-08 23:46:41,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b67415e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:41, skipping insertion in model container [2024-11-08 23:46:41,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:41" (3/3) ... [2024-11-08 23:46:41,390 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i [2024-11-08 23:46:41,404 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:46:41,404 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:46:41,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:46:41,460 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;@5206fea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:46:41,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:46:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:46:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:46:41,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:41,475 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:46:41,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:41,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1735538060, now seen corresponding path program 1 times [2024-11-08 23:46:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128159272] [2024-11-08 23:46:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:46:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:46:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:46:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:46:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:46:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:46:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:46:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:46:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:46:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:46:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:46:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:46:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:46:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:46:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:46:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:46:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:46:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:46:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128159272] [2024-11-08 23:46:41,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128159272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:41,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:46:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081821849] [2024-11-08 23:46:41,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:41,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:46:41,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:46:41,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:46:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:46:41,900 INFO L87 Difference]: Start difference. First operand has 65 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:46:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:41,926 INFO L93 Difference]: Finished difference Result 127 states and 207 transitions. [2024-11-08 23:46:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:46:41,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-08 23:46:41,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:41,939 INFO L225 Difference]: With dead ends: 127 [2024-11-08 23:46:41,939 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 23:46:41,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:46:41,949 INFO L432 NwaCegarLoop]: 94 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, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:46:41,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:46:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 23:46:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 23:46:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:46:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 90 transitions. [2024-11-08 23:46:41,992 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 90 transitions. Word has length 104 [2024-11-08 23:46:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:41,993 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 90 transitions. [2024-11-08 23:46:41,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:46:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 90 transitions. [2024-11-08 23:46:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 23:46:41,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:41,997 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:46:41,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:46:41,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1923754936, now seen corresponding path program 1 times [2024-11-08 23:46:41,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:41,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884168330] [2024-11-08 23:46:42,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:46:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:46:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:46:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:46:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:46:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:46:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:46:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:46:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:46:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:46:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:46:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:46:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:46:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:46:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:46:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:46:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:46:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:46:43,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884168330] [2024-11-08 23:46:43,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884168330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:43,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:43,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:46:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643319060] [2024-11-08 23:46:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:46:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:46:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:46:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:46:43,419 INFO L87 Difference]: Start difference. First operand 61 states and 90 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:46:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:43,697 INFO L93 Difference]: Finished difference Result 168 states and 242 transitions. [2024-11-08 23:46:43,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:46:43,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-08 23:46:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:43,702 INFO L225 Difference]: With dead ends: 168 [2024-11-08 23:46:43,703 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 23:46:43,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:46:43,706 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 60 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:46:43,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 271 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:46:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 23:46:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2024-11-08 23:46:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:46:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2024-11-08 23:46:43,737 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 104 [2024-11-08 23:46:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:43,738 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2024-11-08 23:46:43,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:46:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2024-11-08 23:46:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 23:46:43,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:43,742 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:46:43,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:46:43,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:43,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -656564430, now seen corresponding path program 1 times [2024-11-08 23:46:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:43,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230479974] [2024-11-08 23:46:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:46:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:46:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:46:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:46:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:46:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:46:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:46:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:46:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:46:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:46:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:46:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:46:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:46:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:46:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:46:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:46:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:47,146 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:46:47,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:46:47,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230479974] [2024-11-08 23:46:47,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230479974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:47,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:47,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:46:47,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035596309] [2024-11-08 23:46:47,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:47,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:46:47,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:46:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:46:47,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:46:47,149 INFO L87 Difference]: Start difference. First operand 96 states and 136 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:46:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:48,135 INFO L93 Difference]: Finished difference Result 314 states and 429 transitions. [2024-11-08 23:46:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 23:46:48,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-08 23:46:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:48,139 INFO L225 Difference]: With dead ends: 314 [2024-11-08 23:46:48,139 INFO L226 Difference]: Without dead ends: 221 [2024-11-08 23:46:48,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:46:48,141 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 131 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:46:48,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 339 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:46:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-08 23:46:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 140. [2024-11-08 23:46:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 111 states have internal predecessors, (146), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:46:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2024-11-08 23:46:48,161 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 105 [2024-11-08 23:46:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:48,162 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2024-11-08 23:46:48,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:46:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2024-11-08 23:46:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 23:46:48,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:48,164 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:46:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:46:48,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:48,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1244863474, now seen corresponding path program 1 times [2024-11-08 23:46:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497669932] [2024-11-08 23:46:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:46:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:46:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:46:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:46:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:46:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:46:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:46:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:46:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:46:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:46:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:46:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:46:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:46:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:46:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:46:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:46:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:46:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:46:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497669932] [2024-11-08 23:46:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497669932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:48,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:48,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:46:48,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873816176] [2024-11-08 23:46:48,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:48,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:46:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:46:48,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:46:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:46:48,263 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:46:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:48,302 INFO L93 Difference]: Finished difference Result 284 states and 398 transitions. [2024-11-08 23:46:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:46:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2024-11-08 23:46:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:48,306 INFO L225 Difference]: With dead ends: 284 [2024-11-08 23:46:48,306 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 23:46:48,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-08 23:46:48,311 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 57 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:46:48,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 185 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:46:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 23:46:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-08 23:46:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 114 states have internal predecessors, (142), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 23:46:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 194 transitions. [2024-11-08 23:46:48,329 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 194 transitions. Word has length 105 [2024-11-08 23:46:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:48,330 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 194 transitions. [2024-11-08 23:46:48,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 23:46:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 194 transitions. [2024-11-08 23:46:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-08 23:46:48,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:48,333 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:46:48,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:46:48,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:48,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash -549703581, now seen corresponding path program 1 times [2024-11-08 23:46:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:46:48,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215444566] [2024-11-08 23:46:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:46:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:46:48,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:46:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:46:48,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:46:48,434 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:46:48,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:46:48,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:46:48,440 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:46:48,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:46:48,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:46:48 BoogieIcfgContainer [2024-11-08 23:46:48,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:46:48,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:46:48,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:46:48,529 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:46:48,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:41" (3/4) ... [2024-11-08 23:46:48,531 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:46:48,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:46:48,533 INFO L158 Benchmark]: Toolchain (without parser) took 8103.63ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 140.6MB in the beginning and 232.7MB in the end (delta: -92.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:46:48,533 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 102.8MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:46:48,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.93ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 125.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:46:48,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.27ms. Allocated memory is still 186.6MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:46:48,534 INFO L158 Benchmark]: Boogie Preprocessor took 45.19ms. Allocated memory is still 186.6MB. Free memory was 123.4MB in the beginning and 120.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:46:48,534 INFO L158 Benchmark]: RCFGBuilder took 486.80ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 140.1MB in the end (delta: -19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:46:48,534 INFO L158 Benchmark]: TraceAbstraction took 7146.79ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 140.1MB in the beginning and 232.7MB in the end (delta: -92.6MB). Peak memory consumption was 150.8MB. Max. memory is 16.1GB. [2024-11-08 23:46:48,535 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 270.5MB. Free memory is still 232.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:46:48,536 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.23ms. Allocated memory is still 102.8MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.93ms. Allocated memory is still 186.6MB. Free memory was 140.1MB in the beginning and 125.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.27ms. Allocated memory is still 186.6MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.19ms. Allocated memory is still 186.6MB. Free memory was 123.4MB in the beginning and 120.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 486.80ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 140.1MB in the end (delta: -19.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7146.79ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 140.1MB in the beginning and 232.7MB in the end (delta: -92.6MB). Peak memory consumption was 150.8MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 270.5MB. Free memory is still 232.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -64; [L25] signed long int var_1_4 = -4; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed char var_1_7 = 32; [L29] signed char var_1_8 = -8; [L30] signed char var_1_9 = 10; [L31] double var_1_10 = 1.6; [L32] double var_1_11 = 127.25; [L33] double var_1_12 = 2.5; VAL [isInitial=0, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=0, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L104] isInitial = 1 [L105] FCALL initially() [L106] int k_loop; [L107] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=0, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L107] COND TRUE k_loop < 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L75] RET assume_abort_if_not(var_1_3 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] CALL assume_abort_if_not(var_1_3 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_3 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L78] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L83] var_1_6 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L86] var_1_8 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=10] [L87] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=10] [L88] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=10] [L88] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=10] [L89] var_1_9 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L90] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L91] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L91] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L92] var_1_11 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L93] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L94] var_1_12 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L95] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L109] RET updateVariables() [L110] CALL step() [L37] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L38] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L43] COND TRUE \read(var_1_2) [L44] var_1_1 = (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L56] unsigned char stepLocal_2 = var_1_5; [L57] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=-1, stepLocal_2=-255, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L58] COND TRUE ! var_1_6 [L59] var_1_10 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=-1, stepLocal_2=-255, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L110] RET step() [L111] CALL, EXPR property() [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L100] EXPR (! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L100-L101] return ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741823, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-1, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 889 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 465 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 424 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 98 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 2261 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:46:48,568 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-85.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 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:46:50,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:46:51,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:46:51,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:46:51,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:46:51,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:46:51,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:46:51,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:46:51,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:46:51,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:46:51,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:46:51,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:46:51,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:46:51,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:46:51,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:46:51,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:46:51,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:46:51,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:46:51,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:46:51,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:46:51,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:46:51,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:46:51,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:46:51,052 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:46:51,052 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:46:51,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:46:51,053 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:46:51,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:46:51,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:46:51,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:46:51,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:46:51,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:46:51,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:46:51,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:46:51,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:46:51,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:46:51,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:46:51,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:46:51,057 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:46:51,057 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:46:51,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:46:51,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:46:51,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:46:51,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:46:51,059 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 -> 4532f74b04e01e58202f923b507d6272ee7cdb7ef4468329dcf73de3b3b2659c [2024-11-08 23:46:51,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:46:51,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:46:51,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:46:51,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:46:51,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:46:51,431 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-85.i [2024-11-08 23:46:53,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:46:53,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:46:53,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-85.i [2024-11-08 23:46:53,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82aead3b/1a51fca4344146cfb32e60c69d5799f5/FLAG714277966 [2024-11-08 23:46:53,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82aead3b/1a51fca4344146cfb32e60c69d5799f5 [2024-11-08 23:46:53,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:46:53,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:46:53,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:53,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:46:53,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:46:53,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f59b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53, skipping insertion in model container [2024-11-08 23:46:53,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:46:53,634 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-85.i[915,928] [2024-11-08 23:46:53,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:53,718 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:46:53,729 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-85.i[915,928] [2024-11-08 23:46:53,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:46:53,785 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:46:53,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53 WrapperNode [2024-11-08 23:46:53,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:46:53,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:53,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:46:53,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:46:53,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,832 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-08 23:46:53,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:46:53,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:46:53,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:46:53,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:46:53,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:46:53,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:46:53,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:46:53,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:46:53,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:46:53,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (1/1) ... [2024-11-08 23:46:53,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:46:53,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:46:53,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:46:53,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:46:53,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:46:53,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:46:53,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:46:53,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:46:53,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:46:53,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:46:54,039 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:46:54,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:46:54,337 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 23:46:54,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:46:54,371 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:46:54,371 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:46:54,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:54 BoogieIcfgContainer [2024-11-08 23:46:54,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:46:54,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:46:54,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:46:54,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:46:54,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:46:53" (1/3) ... [2024-11-08 23:46:54,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb62e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:54, skipping insertion in model container [2024-11-08 23:46:54,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:46:53" (2/3) ... [2024-11-08 23:46:54,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb62e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:46:54, skipping insertion in model container [2024-11-08 23:46:54,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:46:54" (3/3) ... [2024-11-08 23:46:54,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-85.i [2024-11-08 23:46:54,404 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:46:54,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:46:54,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:46:54,482 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;@4a48a1a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:46:54,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:46:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:46:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:46:54,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:54,498 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:46:54,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:54,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -739881023, now seen corresponding path program 1 times [2024-11-08 23:46:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:46:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962511431] [2024-11-08 23:46:54,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:54,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:46:54,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:46:54,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:46:54,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:46:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:54,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:46:54,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:46:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-08 23:46:54,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:46:54,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:46:54,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962511431] [2024-11-08 23:46:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962511431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:46:54,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:46:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:46:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714141404] [2024-11-08 23:46:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:46:54,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:46:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:46:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:46:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:46:54,821 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:46:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:46:54,854 INFO L93 Difference]: Finished difference Result 105 states and 173 transitions. [2024-11-08 23:46:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:46:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-08 23:46:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:46:54,866 INFO L225 Difference]: With dead ends: 105 [2024-11-08 23:46:54,866 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 23:46:54,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:46:54,873 INFO L432 NwaCegarLoop]: 77 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, 77 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:46:54,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:46:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 23:46:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-08 23:46:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:46:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-08 23:46:54,918 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 102 [2024-11-08 23:46:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:46:54,919 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-08 23:46:54,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:46:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-08 23:46:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:46:54,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:46:54,925 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:46:54,933 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 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:46:55,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:46:55,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:46:55,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:46:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash -967152259, now seen corresponding path program 1 times [2024-11-08 23:46:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:46:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115043992] [2024-11-08 23:46:55,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:46:55,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:46:55,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:46:55,135 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:46:55,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:46:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:46:55,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 23:46:55,314 INFO L278 TraceCheckSpWp]: Computing forward predicates...