./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-87.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 1d6740d93249b8004eae6c6ec99a57fdd342d0b18a807811334b011905a57c0b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:26:58,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:26:58,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:26:58,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:26:58,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:26:58,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:26:58,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:26:58,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:26:58,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:26:58,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:26:58,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:26:58,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:26:58,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:26:58,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:26:58,888 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:26:58,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:26:58,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:26:58,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:26:58,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:26:58,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:26:58,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:26:58,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:26:58,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:26:58,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:26:58,895 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:26:58,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:26:58,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:26:58,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:26:58,896 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:26:58,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:26:58,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:26:58,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:26:58,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:26:58,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:26:58,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:26:58,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:26:58,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:26:58,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:26:58,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:26:58,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:26:58,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:26:58,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:26:58,901 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 -> 1d6740d93249b8004eae6c6ec99a57fdd342d0b18a807811334b011905a57c0b [2024-11-16 16:26:59,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:26:59,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:26:59,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:26:59,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:26:59,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:26:59,185 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-87.i [2024-11-16 16:27:00,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:27:00,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:27:00,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-87.i [2024-11-16 16:27:00,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c891a180/948b515e2123430e9dec64371d132102/FLAG9281f47d3 [2024-11-16 16:27:00,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c891a180/948b515e2123430e9dec64371d132102 [2024-11-16 16:27:00,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:27:00,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:27:00,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:27:00,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:27:00,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:27:00,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:27:00" (1/1) ... [2024-11-16 16:27:00,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67432774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:00, skipping insertion in model container [2024-11-16 16:27:00,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:27:00" (1/1) ... [2024-11-16 16:27:00,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:27:01,048 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-87.i[915,928] [2024-11-16 16:27:01,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:27:01,133 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:27:01,187 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-87.i[915,928] [2024-11-16 16:27:01,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:27:01,255 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:27:01,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01 WrapperNode [2024-11-16 16:27:01,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:27:01,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:27:01,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:27:01,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:27:01,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,314 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-16 16:27:01,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:27:01,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:27:01,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:27:01,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:27:01,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,345 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-16 16:27:01,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:27:01,355 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:27:01,355 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:27:01,355 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:27:01,356 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (1/1) ... [2024-11-16 16:27:01,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:27:01,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:27:01,392 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-16 16:27:01,395 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-16 16:27:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:27:01,438 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:27:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:27:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:27:01,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:27:01,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:27:01,518 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:27:01,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:27:01,766 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~bitwise12#1;havoc property_#t~short13#1; [2024-11-16 16:27:01,802 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 16:27:01,806 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:27:01,833 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:27:01,834 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 16:27:01,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:27:01 BoogieIcfgContainer [2024-11-16 16:27:01,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:27:01,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:27:01,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:27:01,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:27:01,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:27:00" (1/3) ... [2024-11-16 16:27:01,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c4efb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:27:01, skipping insertion in model container [2024-11-16 16:27:01,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:01" (2/3) ... [2024-11-16 16:27:01,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c4efb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:27:01, skipping insertion in model container [2024-11-16 16:27:01,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:27:01" (3/3) ... [2024-11-16 16:27:01,846 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-87.i [2024-11-16 16:27:01,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:27:01,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:27:01,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:27:01,942 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;@5a75800b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:27:01,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:27:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:27:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:27:01,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:01,960 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:01,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:01,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 38078727, now seen corresponding path program 1 times [2024-11-16 16:27:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:01,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671903900] [2024-11-16 16:27:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671903900] [2024-11-16 16:27:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671903900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:02,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:02,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:27:02,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143046899] [2024-11-16 16:27:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:02,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:27:02,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:02,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:27:02,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:27:02,353 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:27:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:02,381 INFO L93 Difference]: Finished difference Result 116 states and 182 transitions. [2024-11-16 16:27:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:27:02,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-16 16:27:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:02,390 INFO L225 Difference]: With dead ends: 116 [2024-11-16 16:27:02,390 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 16:27:02,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:27:02,396 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:02,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:27:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 16:27:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-16 16:27:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:27:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-11-16 16:27:02,437 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 98 [2024-11-16 16:27:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-11-16 16:27:02,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:27:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-11-16 16:27:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:27:02,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:02,445 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:02,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:27:02,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:02,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1760387447, now seen corresponding path program 1 times [2024-11-16 16:27:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:02,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481036968] [2024-11-16 16:27:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481036968] [2024-11-16 16:27:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481036968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:27:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525513902] [2024-11-16 16:27:04,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:04,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:27:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:04,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:27:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:27:04,154 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:04,442 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2024-11-16 16:27:04,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:27:04,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-16 16:27:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:04,445 INFO L225 Difference]: With dead ends: 156 [2024-11-16 16:27:04,445 INFO L226 Difference]: Without dead ends: 104 [2024-11-16 16:27:04,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:27:04,447 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 69 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:04,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 356 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:27:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-16 16:27:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 67. [2024-11-16 16:27:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:27:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-11-16 16:27:04,464 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 98 [2024-11-16 16:27:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:04,465 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-11-16 16:27:04,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-16 16:27:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:27:04,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:04,470 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:04,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:27:04,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:04,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash -252835638, now seen corresponding path program 1 times [2024-11-16 16:27:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082937169] [2024-11-16 16:27:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:09,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:09,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082937169] [2024-11-16 16:27:09,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082937169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:09,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:09,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:27:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356938114] [2024-11-16 16:27:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:09,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:27:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:09,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:27:09,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:27:09,677 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:10,034 INFO L93 Difference]: Finished difference Result 154 states and 219 transitions. [2024-11-16 16:27:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:27:10,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-16 16:27:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:10,037 INFO L225 Difference]: With dead ends: 154 [2024-11-16 16:27:10,037 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 16:27:10,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:27:10,039 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 71 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:10,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 188 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:27:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 16:27:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2024-11-16 16:27:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:27:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-16 16:27:10,054 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 98 [2024-11-16 16:27:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:10,054 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-16 16:27:10,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-16 16:27:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:27:10,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:10,058 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:10,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:27:10,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:10,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash -181369259, now seen corresponding path program 1 times [2024-11-16 16:27:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901018455] [2024-11-16 16:27:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:10,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:12,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:12,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901018455] [2024-11-16 16:27:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901018455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:12,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:12,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:27:12,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21925739] [2024-11-16 16:27:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:12,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:27:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:27:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:27:12,673 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:13,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:13,408 INFO L93 Difference]: Finished difference Result 218 states and 302 transitions. [2024-11-16 16:27:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 16:27:13,408 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-16 16:27:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:13,412 INFO L225 Difference]: With dead ends: 218 [2024-11-16 16:27:13,414 INFO L226 Difference]: Without dead ends: 156 [2024-11-16 16:27:13,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:27:13,416 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 115 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:13,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 523 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:27:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-16 16:27:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 78. [2024-11-16 16:27:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:27:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2024-11-16 16:27:13,437 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 99 [2024-11-16 16:27:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:13,440 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2024-11-16 16:27:13,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2024-11-16 16:27:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:27:13,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:13,442 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:13,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:27:13,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:13,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash -474772266, now seen corresponding path program 1 times [2024-11-16 16:27:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:13,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978271961] [2024-11-16 16:27:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:13,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978271961] [2024-11-16 16:27:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978271961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:27:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847987354] [2024-11-16 16:27:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:13,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:27:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:13,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:27:13,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:27:13,756 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:14,007 INFO L93 Difference]: Finished difference Result 221 states and 311 transitions. [2024-11-16 16:27:14,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:27:14,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-16 16:27:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:14,009 INFO L225 Difference]: With dead ends: 221 [2024-11-16 16:27:14,009 INFO L226 Difference]: Without dead ends: 146 [2024-11-16 16:27:14,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:27:14,010 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 74 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:14,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 283 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:27:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-16 16:27:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 123. [2024-11-16 16:27:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 105 states have internal predecessors, (144), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:27:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-11-16 16:27:14,030 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 99 [2024-11-16 16:27:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:14,031 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-11-16 16:27:14,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-11-16 16:27:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:27:14,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:14,034 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:14,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:27:14,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:14,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash -691903436, now seen corresponding path program 1 times [2024-11-16 16:27:14,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077472351] [2024-11-16 16:27:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:14,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077472351] [2024-11-16 16:27:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077472351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 16:27:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130937433] [2024-11-16 16:27:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 16:27:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:14,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 16:27:14,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:27:14,852 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:27:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:15,607 INFO L93 Difference]: Finished difference Result 350 states and 493 transitions. [2024-11-16 16:27:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 16:27:15,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-16 16:27:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:15,610 INFO L225 Difference]: With dead ends: 350 [2024-11-16 16:27:15,610 INFO L226 Difference]: Without dead ends: 230 [2024-11-16 16:27:15,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-16 16:27:15,616 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 184 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:15,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 562 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 16:27:15,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-16 16:27:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2024-11-16 16:27:15,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 156 states have internal predecessors, (210), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 16:27:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 274 transitions. [2024-11-16 16:27:15,657 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 274 transitions. Word has length 99 [2024-11-16 16:27:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:15,658 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 274 transitions. [2024-11-16 16:27:15,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:27:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 274 transitions. [2024-11-16 16:27:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:27:15,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:15,660 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:15,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:27:15,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash -985306443, now seen corresponding path program 1 times [2024-11-16 16:27:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353430157] [2024-11-16 16:27:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353430157] [2024-11-16 16:27:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353430157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:27:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232255979] [2024-11-16 16:27:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:15,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:27:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:15,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:27:15,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:27:15,914 INFO L87 Difference]: Start difference. First operand 191 states and 274 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:27:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:16,062 INFO L93 Difference]: Finished difference Result 363 states and 521 transitions. [2024-11-16 16:27:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:27:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-16 16:27:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:16,064 INFO L225 Difference]: With dead ends: 363 [2024-11-16 16:27:16,064 INFO L226 Difference]: Without dead ends: 184 [2024-11-16 16:27:16,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:27:16,066 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 62 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:16,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 364 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:27:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-16 16:27:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2024-11-16 16:27:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 146 states have internal predecessors, (193), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 16:27:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 257 transitions. [2024-11-16 16:27:16,094 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 257 transitions. Word has length 99 [2024-11-16 16:27:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:16,094 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 257 transitions. [2024-11-16 16:27:16,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-16 16:27:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 257 transitions. [2024-11-16 16:27:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:27:16,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:16,096 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:16,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:27:16,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:16,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 636200843, now seen corresponding path program 1 times [2024-11-16 16:27:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:16,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824737273] [2024-11-16 16:27:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:16,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:18,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824737273] [2024-11-16 16:27:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824737273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:18,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:18,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:27:18,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173918100] [2024-11-16 16:27:18,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:18,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:27:18,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:27:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:27:18,921 INFO L87 Difference]: Start difference. First operand 181 states and 257 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:21,006 INFO L93 Difference]: Finished difference Result 354 states and 472 transitions. [2024-11-16 16:27:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 16:27:21,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-11-16 16:27:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:21,009 INFO L225 Difference]: With dead ends: 354 [2024-11-16 16:27:21,009 INFO L226 Difference]: Without dead ends: 351 [2024-11-16 16:27:21,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:27:21,010 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:21,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 466 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:27:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-16 16:27:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 290. [2024-11-16 16:27:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 240 states have (on average 1.3083333333333333) internal successors, (314), 245 states have internal predecessors, (314), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:27:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 398 transitions. [2024-11-16 16:27:21,053 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 398 transitions. Word has length 100 [2024-11-16 16:27:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:21,056 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 398 transitions. [2024-11-16 16:27:21,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 398 transitions. [2024-11-16 16:27:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:27:21,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:21,057 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:21,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 16:27:21,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1267132055, now seen corresponding path program 1 times [2024-11-16 16:27:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958427601] [2024-11-16 16:27:21,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958427601] [2024-11-16 16:27:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958427601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:27:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432234440] [2024-11-16 16:27:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:27:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:27:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:27:22,392 INFO L87 Difference]: Start difference. First operand 290 states and 398 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:23,137 INFO L93 Difference]: Finished difference Result 515 states and 700 transitions. [2024-11-16 16:27:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:27:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-11-16 16:27:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:23,141 INFO L225 Difference]: With dead ends: 515 [2024-11-16 16:27:23,141 INFO L226 Difference]: Without dead ends: 318 [2024-11-16 16:27:23,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:27:23,142 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 56 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:23,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 496 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:27:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-16 16:27:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 282. [2024-11-16 16:27:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 237 states have internal predecessors, (301), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:27:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 385 transitions. [2024-11-16 16:27:23,179 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 385 transitions. Word has length 100 [2024-11-16 16:27:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:23,180 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 385 transitions. [2024-11-16 16:27:23,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 385 transitions. [2024-11-16 16:27:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:27:23,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:23,182 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:23,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 16:27:23,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:23,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash 761573430, now seen corresponding path program 1 times [2024-11-16 16:27:23,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:23,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128094866] [2024-11-16 16:27:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:27:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:27:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:27:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:27:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:27:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:27:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:27:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:27:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:27:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:27:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:27:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:27:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:27:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:27:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-16 16:27:24,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:27:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128094866] [2024-11-16 16:27:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128094866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:24,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:27:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540890969] [2024-11-16 16:27:24,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:27:24,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:27:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:27:24,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:27:24,913 INFO L87 Difference]: Start difference. First operand 282 states and 385 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:25,700 INFO L93 Difference]: Finished difference Result 486 states and 659 transitions. [2024-11-16 16:27:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:27:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2024-11-16 16:27:25,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:25,702 INFO L225 Difference]: With dead ends: 486 [2024-11-16 16:27:25,702 INFO L226 Difference]: Without dead ends: 297 [2024-11-16 16:27:25,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:27:25,703 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 53 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:27:25,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 513 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:27:25,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-16 16:27:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 282. [2024-11-16 16:27:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 232 states have (on average 1.293103448275862) internal successors, (300), 237 states have internal predecessors, (300), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 16:27:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 384 transitions. [2024-11-16 16:27:25,740 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 384 transitions. Word has length 100 [2024-11-16 16:27:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:25,740 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 384 transitions. [2024-11-16 16:27:25,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 384 transitions. [2024-11-16 16:27:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 16:27:25,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:25,741 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:25,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 16:27:25,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:25,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash -189402055, now seen corresponding path program 1 times [2024-11-16 16:27:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:27:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936674813] [2024-11-16 16:27:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:27:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:27:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683300563] [2024-11-16 16:27:25,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:25,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:27:25,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:27:25,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:27:25,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 16:27:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:27:25,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:27:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:27:26,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:27:26,161 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:27:26,162 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:27:26,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 16:27:26,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 16:27:26,372 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:26,467 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:27:26,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:27:26 BoogieIcfgContainer [2024-11-16 16:27:26,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:27:26,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:27:26,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:27:26,471 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:27:26,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:27:01" (3/4) ... [2024-11-16 16:27:26,474 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:27:26,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:27:26,476 INFO L158 Benchmark]: Toolchain (without parser) took 25626.73ms. Allocated memory was 159.4MB in the beginning and 752.9MB in the end (delta: 593.5MB). Free memory was 99.1MB in the beginning and 531.4MB in the end (delta: -432.3MB). Peak memory consumption was 162.9MB. Max. memory is 16.1GB. [2024-11-16 16:27:26,476 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:27:26,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.82ms. Allocated memory is still 159.4MB. Free memory was 99.1MB in the beginning and 128.2MB in the end (delta: -29.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 16:27:26,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.21ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:27:26,477 INFO L158 Benchmark]: Boogie Preprocessor took 38.30ms. Allocated memory is still 159.4MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 16:27:26,477 INFO L158 Benchmark]: IcfgBuilder took 479.60ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 106.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 16:27:26,478 INFO L158 Benchmark]: TraceAbstraction took 24630.92ms. Allocated memory was 159.4MB in the beginning and 752.9MB in the end (delta: 593.5MB). Free memory was 105.9MB in the beginning and 531.4MB in the end (delta: -425.5MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. [2024-11-16 16:27:26,478 INFO L158 Benchmark]: Witness Printer took 5.69ms. Allocated memory is still 752.9MB. Free memory is still 531.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:27:26,479 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.19ms. Allocated memory is still 100.7MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.82ms. Allocated memory is still 159.4MB. Free memory was 99.1MB in the beginning and 128.2MB in the end (delta: -29.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.21ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.30ms. Allocated memory is still 159.4MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 479.60ms. Allocated memory is still 159.4MB. Free memory was 124.0MB in the beginning and 106.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24630.92ms. Allocated memory was 159.4MB in the beginning and 752.9MB in the end (delta: 593.5MB). Free memory was 105.9MB in the beginning and 531.4MB in the end (delta: -425.5MB). Peak memory consumption was 170.8MB. Max. memory is 16.1GB. * Witness Printer took 5.69ms. Allocated memory is still 752.9MB. Free memory is still 531.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3164414017; [L25] unsigned long int var_1_4 = 128; [L26] signed char var_1_5 = -128; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 50; [L29] float var_1_8 = 5.1; [L30] float var_1_9 = 63.75; [L31] signed char var_1_10 = 100; [L32] signed long int var_1_12 = 5; [L33] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L100] COND TRUE k_loop < 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L71] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L73] var_1_4 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L76] var_1_6 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_6 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L77] RET assume_abort_if_not(var_1_6 >= -126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L79] var_1_7 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L82] var_1_9 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L83] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L84] var_1_12 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L85] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L86] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L86] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L87] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L87] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=1, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L102] RET updateVariables() [L103] CALL step() [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L40] signed long int stepLocal_1 = -8; [L41] unsigned long int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-45097156609, stepLocal_1=-8, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-128, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L42] COND FALSE !(stepLocal_1 < var_1_4) [L49] var_1_5 = -2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-45097156609, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L51] unsigned long int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-45097156609, stepLocal_3=-45097156609, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L52] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-45097156609, stepLocal_3=-45097156609, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L52] unsigned long int stepLocal_2 = var_1_4 >> var_1_3; [L53] COND TRUE var_1_6 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-45097156609, stepLocal_3=-45097156609, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=51/10] [L54] COND TRUE var_1_6 != stepLocal_3 [L55] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-45097156609, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=2, var_1_9=2] [L58] COND FALSE !((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-45097156609, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=2, var_1_9=2] [L103] RET step() [L104] CALL, EXPR property() [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=2, var_1_9=2] [L93-L94] return (((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1)) && (((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) ? ((var_1_7 >= last_1_var_1_10) ? (var_1_10 == ((signed char) -32)) : (var_1_10 == ((signed char) var_1_7))) : 1) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=-1, var_1_1=-45097156609, var_1_2=1, var_1_3=-53687091201, var_1_4=-8589934592, var_1_5=-2, var_1_6=-1, var_1_7=0, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 767 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 767 mSDsluCounter, 3831 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3014 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2149 IncrementalHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 817 mSDtfsCounter, 2149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 328 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=8, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 317 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1192 NumberOfCodeBlocks, 1192 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 980 ConstructedInterpolants, 0 QuantifiedInterpolants, 10461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3640/3640 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-16 16:27:26,562 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-87.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 1d6740d93249b8004eae6c6ec99a57fdd342d0b18a807811334b011905a57c0b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:27:28,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:27:28,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:27:28,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:27:28,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:27:28,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:27:28,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:27:28,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:27:28,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:27:28,721 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:27:28,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:27:28,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:27:28,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:27:28,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:27:28,726 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:27:28,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:27:28,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:27:28,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:27:28,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:27:28,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:27:28,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:27:28,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:27:28,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:27:28,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:27:28,731 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:27:28,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:27:28,731 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:27:28,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:27:28,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:27:28,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:27:28,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:27:28,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:27:28,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:27:28,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:27:28,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:27:28,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:27:28,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:27:28,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:27:28,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:27:28,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:27:28,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:27:28,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:27:28,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:27:28,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:27:28,738 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 -> 1d6740d93249b8004eae6c6ec99a57fdd342d0b18a807811334b011905a57c0b [2024-11-16 16:27:29,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:27:29,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:27:29,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:27:29,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:27:29,074 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:27:29,075 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-87.i [2024-11-16 16:27:30,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:27:30,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:27:30,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-87.i [2024-11-16 16:27:30,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade6c8030/ebefa2c80dc846cb9765e9079dcf6eb0/FLAG55508ed68 [2024-11-16 16:27:30,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade6c8030/ebefa2c80dc846cb9765e9079dcf6eb0 [2024-11-16 16:27:30,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:27:30,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:27:30,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:27:30,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:27:30,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:27:30,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:27:30" (1/1) ... [2024-11-16 16:27:30,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66bc38a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:30, skipping insertion in model container [2024-11-16 16:27:30,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:27:30" (1/1) ... [2024-11-16 16:27:30,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:27:30,978 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-87.i[915,928] [2024-11-16 16:27:31,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:27:31,046 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:27:31,059 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-87.i[915,928] [2024-11-16 16:27:31,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:27:31,111 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:27:31,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31 WrapperNode [2024-11-16 16:27:31,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:27:31,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:27:31,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:27:31,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:27:31,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,165 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-16 16:27:31,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:27:31,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:27:31,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:27:31,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:27:31,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,206 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-16 16:27:31,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:27:31,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:27:31,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:27:31,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:27:31,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (1/1) ... [2024-11-16 16:27:31,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:27:31,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:27:31,258 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-16 16:27:31,261 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-16 16:27:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:27:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:27:31,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:27:31,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:27:31,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:27:31,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:27:31,395 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:27:31,398 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:27:31,699 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-16 16:27:31,700 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:27:31,711 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:27:31,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:27:31,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:27:31 BoogieIcfgContainer [2024-11-16 16:27:31,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:27:31,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:27:31,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:27:31,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:27:31,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:27:30" (1/3) ... [2024-11-16 16:27:31,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3828cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:27:31, skipping insertion in model container [2024-11-16 16:27:31,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:27:31" (2/3) ... [2024-11-16 16:27:31,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3828cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:27:31, skipping insertion in model container [2024-11-16 16:27:31,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:27:31" (3/3) ... [2024-11-16 16:27:31,722 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-87.i [2024-11-16 16:27:31,736 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:27:31,736 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:27:31,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:27:31,803 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;@57fb28c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:27:31,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:27:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:27:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 16:27:31,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:31,819 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:31,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1803869262, now seen corresponding path program 1 times [2024-11-16 16:27:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:27:31,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439424045] [2024-11-16 16:27:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:31,840 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-16 16:27:31,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:27:31,846 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-16 16:27:31,847 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-16 16:27:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:32,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:27:32,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:27:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-16 16:27:32,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:27:32,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:27:32,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439424045] [2024-11-16 16:27:32,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439424045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:27:32,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:27:32,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:27:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225151762] [2024-11-16 16:27:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:27:32,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:27:32,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:27:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:27:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:27:32,100 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:27:32,131 INFO L93 Difference]: Finished difference Result 100 states and 160 transitions. [2024-11-16 16:27:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:27:32,133 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-16 16:27:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:27:32,141 INFO L225 Difference]: With dead ends: 100 [2024-11-16 16:27:32,141 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 16:27:32,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-16 16:27:32,150 INFO L432 NwaCegarLoop]: 71 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, 71 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-16 16:27:32,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:27:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 16:27:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 16:27:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 16:27:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-16 16:27:32,198 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 94 [2024-11-16 16:27:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:27:32,198 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-16 16:27:32,198 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-16 16:27:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-16 16:27:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 16:27:32,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:27:32,204 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:27:32,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:27:32,405 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-16 16:27:32,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:27:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:27:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1927531060, now seen corresponding path program 1 times [2024-11-16 16:27:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:27:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983263151] [2024-11-16 16:27:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:32,408 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-16 16:27:32,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:27:32,411 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-16 16:27:32,412 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-16 16:27:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:32,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 16:27:32,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:27:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 54 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-16 16:27:33,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:27:33,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:27:33,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983263151] [2024-11-16 16:27:33,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983263151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:27:33,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2124345974] [2024-11-16 16:27:33,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:27:33,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 16:27:33,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 16:27:33,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 16:27:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-16 16:27:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:27:33,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 16:27:33,537 INFO L278 TraceCheckSpWp]: Computing forward predicates...