./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.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 ec19acff02761ce4cb6bd833355f9203a252d8e9565b5d08ccbe5e49c9ce80f5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:11:56,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:11:56,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:11:56,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:11:56,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:11:56,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:11:56,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:11:56,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:11:56,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:11:56,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:11:56,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:11:56,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:11:56,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:11:56,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:11:56,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:11:56,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:11:56,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:11:56,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:11:56,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:11:56,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:11:56,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:11:56,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:11:56,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:11:56,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:11:56,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:11:56,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:11:56,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:11:56,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:11:56,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:11:56,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:11:56,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:11:56,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:11:56,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:56,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:11:56,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:11:56,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:11:56,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:11:56,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:11:56,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:11:56,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:11:56,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:11:56,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:11:56,517 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 -> ec19acff02761ce4cb6bd833355f9203a252d8e9565b5d08ccbe5e49c9ce80f5 [2024-11-08 23:11:56,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:11:56,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:11:56,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:11:56,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:11:56,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:11:56,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i [2024-11-08 23:11:58,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:58,182 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:58,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i [2024-11-08 23:11:58,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a894e09/7b06fb6357e644a1b238a258352219b8/FLAG867bcb7b1 [2024-11-08 23:11:58,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70a894e09/7b06fb6357e644a1b238a258352219b8 [2024-11-08 23:11:58,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:58,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:58,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:58,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:58,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:58,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa5f993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58, skipping insertion in model container [2024-11-08 23:11:58,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:58,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i[916,929] [2024-11-08 23:11:58,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:58,825 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:58,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i[916,929] [2024-11-08 23:11:58,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:58,869 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:58,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58 WrapperNode [2024-11-08 23:11:58,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:58,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:58,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:58,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:58,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,933 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-08 23:11:58,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:58,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:58,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:58,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:58,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,980 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:11:58,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:59,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:59,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:59,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:59,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:59,005 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:59,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:59,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:11:59,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:11:59,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:11:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:11:59,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:11:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:11:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:59,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:59,127 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:59,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:11:59,362 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:11:59,363 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:11:59,376 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:11:59,378 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:11:59,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:59 BoogieIcfgContainer [2024-11-08 23:11:59,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:11:59,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:11:59,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:11:59,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:11:59,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:58" (1/3) ... [2024-11-08 23:11:59,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25631844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:59, skipping insertion in model container [2024-11-08 23:11:59,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (2/3) ... [2024-11-08 23:11:59,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25631844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:59, skipping insertion in model container [2024-11-08 23:11:59,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:59" (3/3) ... [2024-11-08 23:11:59,387 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-66.i [2024-11-08 23:11:59,400 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:11:59,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:11:59,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:11:59,465 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;@329a144c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:11:59,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:11:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 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-08 23:11:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 23:11:59,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:59,482 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] [2024-11-08 23:11:59,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:59,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1691062779, now seen corresponding path program 1 times [2024-11-08 23:11:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:59,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444056426] [2024-11-08 23:11:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:11:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:11:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:11:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:11:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:59,788 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-08 23:11:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:59,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444056426] [2024-11-08 23:11:59,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444056426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:59,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:59,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:11:59,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796418817] [2024-11-08 23:11:59,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:11:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:11:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:59,815 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-08 23:11:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:59,833 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2024-11-08 23:11:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:11:59,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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 89 [2024-11-08 23:11:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:59,842 INFO L225 Difference]: With dead ends: 83 [2024-11-08 23:11:59,842 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 23:11:59,846 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-08 23:11:59,849 INFO L432 NwaCegarLoop]: 59 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, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:59,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 23:11:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 23:11:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-08 23:11:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2024-11-08 23:11:59,878 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 89 [2024-11-08 23:11:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2024-11-08 23:11:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (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-08 23:11:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2024-11-08 23:11:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 23:11:59,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:59,882 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] [2024-11-08 23:11:59,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:11:59,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:59,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1552521403, now seen corresponding path program 1 times [2024-11-08 23:11:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:59,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124766968] [2024-11-08 23:11:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,327 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-08 23:12:00,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:00,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124766968] [2024-11-08 23:12:00,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124766968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:00,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:00,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:12:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705025743] [2024-11-08 23:12:00,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:00,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:12:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:12:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:12:00,330 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08 23:12:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:00,406 INFO L93 Difference]: Finished difference Result 117 states and 171 transitions. [2024-11-08 23:12:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:12:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 89 [2024-11-08 23:12:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:00,409 INFO L225 Difference]: With dead ends: 117 [2024-11-08 23:12:00,410 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 23:12:00,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:12:00,414 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:00,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 98 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:12:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 23:12:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-08 23:12:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 23:12:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2024-11-08 23:12:00,439 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 89 [2024-11-08 23:12:00,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:00,440 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2024-11-08 23:12:00,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08 23:12:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2024-11-08 23:12:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:12:00,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:00,441 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] [2024-11-08 23:12:00,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:12:00,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:00,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash -828174430, now seen corresponding path program 1 times [2024-11-08 23:12:00,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:00,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816014863] [2024-11-08 23:12:00,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:00,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:00,879 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-08 23:12:00,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816014863] [2024-11-08 23:12:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816014863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:00,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:00,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:12:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060243007] [2024-11-08 23:12:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:00,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:12:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:12:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:12:00,885 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-08 23:12:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:01,080 INFO L93 Difference]: Finished difference Result 196 states and 284 transitions. [2024-11-08 23:12:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:12:01,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 90 [2024-11-08 23:12:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:01,083 INFO L225 Difference]: With dead ends: 196 [2024-11-08 23:12:01,083 INFO L226 Difference]: Without dead ends: 123 [2024-11-08 23:12:01,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:12:01,085 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 78 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:01,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 173 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:12:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-08 23:12:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2024-11-08 23:12:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 23:12:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-11-08 23:12:01,114 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 90 [2024-11-08 23:12:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:01,115 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-11-08 23:12:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-08 23:12:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-11-08 23:12:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:12:01,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:01,117 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] [2024-11-08 23:12:01,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:12:01,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:01,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -830021472, now seen corresponding path program 1 times [2024-11-08 23:12:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256623414] [2024-11-08 23:12:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:03,236 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-08 23:12:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:03,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256623414] [2024-11-08 23:12:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256623414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:03,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 23:12:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984839384] [2024-11-08 23:12:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:12:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:12:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:12:03,240 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:12:03,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:03,710 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2024-11-08 23:12:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:12:03,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2024-11-08 23:12:03,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:03,712 INFO L225 Difference]: With dead ends: 128 [2024-11-08 23:12:03,712 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 23:12:03,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2024-11-08 23:12:03,713 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 72 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:03,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 364 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:12:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 23:12:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2024-11-08 23:12:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 states have internal predecessors, (80), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 23:12:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-11-08 23:12:03,727 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 90 [2024-11-08 23:12:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-11-08 23:12:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-08 23:12:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-11-08 23:12:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:12:03,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:03,729 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] [2024-11-08 23:12:03,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:12:03,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:03,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:03,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1518851614, now seen corresponding path program 1 times [2024-11-08 23:12:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:03,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311494981] [2024-11-08 23:12:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:03,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:06,637 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-08 23:12:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311494981] [2024-11-08 23:12:06,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311494981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:06,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:12:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121849016] [2024-11-08 23:12:06,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:12:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:12:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:12:06,639 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-08 23:12:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:07,133 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2024-11-08 23:12:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:12:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 90 [2024-11-08 23:12:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:07,137 INFO L225 Difference]: With dead ends: 157 [2024-11-08 23:12:07,139 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 23:12:07,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:12:07,140 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 105 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:07,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 292 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:12:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 23:12:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2024-11-08 23:12:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 23:12:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2024-11-08 23:12:07,160 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 177 transitions. Word has length 90 [2024-11-08 23:12:07,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:07,160 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 177 transitions. [2024-11-08 23:12:07,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-08 23:12:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2024-11-08 23:12:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:12:07,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:07,162 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] [2024-11-08 23:12:07,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:12:07,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:07,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1461593312, now seen corresponding path program 1 times [2024-11-08 23:12:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:07,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753679792] [2024-11-08 23:12:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 23:12:07,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:07,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753679792] [2024-11-08 23:12:07,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753679792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:07,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:07,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:12:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729137965] [2024-11-08 23:12:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:07,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:12:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:12:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:12:07,267 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (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-08 23:12:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:07,363 INFO L93 Difference]: Finished difference Result 200 states and 278 transitions. [2024-11-08 23:12:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:12:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (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 90 [2024-11-08 23:12:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:07,365 INFO L225 Difference]: With dead ends: 200 [2024-11-08 23:12:07,366 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 23:12:07,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:12:07,368 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 67 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:07,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 154 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:12:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 23:12:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-11-08 23:12:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 86 states have internal predecessors, (101), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 23:12:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 185 transitions. [2024-11-08 23:12:07,390 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 185 transitions. Word has length 90 [2024-11-08 23:12:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:07,390 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 185 transitions. [2024-11-08 23:12:07,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (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-08 23:12:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 185 transitions. [2024-11-08 23:12:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:12:07,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:07,395 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] [2024-11-08 23:12:07,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:12:07,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:07,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash 256155748, now seen corresponding path program 1 times [2024-11-08 23:12:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:07,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153260458] [2024-11-08 23:12:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:07,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:12:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:12:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:12:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:12:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:12:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:12:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:12:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:12:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:12:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:12:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:12:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:12:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:12:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:12:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:09,058 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-08 23:12:09,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:12:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153260458] [2024-11-08 23:12:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153260458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:09,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:09,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:12:09,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707651926] [2024-11-08 23:12:09,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:12:09,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:12:09,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:12:09,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:12:09,060 INFO L87 Difference]: Start difference. First operand 136 states and 185 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-08 23:12:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:09,578 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2024-11-08 23:12:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:12:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 90 [2024-11-08 23:12:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:09,579 INFO L225 Difference]: With dead ends: 173 [2024-11-08 23:12:09,579 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 23:12:09,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-08 23:12:09,583 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 94 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:09,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 289 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:12:09,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 23:12:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 137. [2024-11-08 23:12:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 23:12:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 187 transitions. [2024-11-08 23:12:09,596 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 187 transitions. Word has length 90 [2024-11-08 23:12:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:09,596 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 187 transitions. [2024-11-08 23:12:09,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-08 23:12:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 187 transitions. [2024-11-08 23:12:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 23:12:09,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:09,598 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] [2024-11-08 23:12:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:12:09,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 313414050, now seen corresponding path program 1 times [2024-11-08 23:12:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:12:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389952676] [2024-11-08 23:12:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:12:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat