./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.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 bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:43:25,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:43:25,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:43:25,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:43:25,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:43:25,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:43:25,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:43:25,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:43:25,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:43:25,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:43:25,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:43:25,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:43:25,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:43:25,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:43:25,336 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:43:25,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:43:25,337 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:43:25,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:43:25,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:43:25,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:43:25,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:43:25,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:43:25,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:43:25,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:43:25,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:43:25,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:43:25,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:43:25,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:43:25,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:43:25,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:43:25,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:43:25,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:43:25,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:43:25,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:43:25,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:43:25,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:43:25,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:43:25,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:43:25,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:43:25,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:43:25,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:43:25,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:43:25,344 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 -> bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 [2024-11-12 07:43:25,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:43:25,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:43:25,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:43:25,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:43:25,580 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:43:25,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2024-11-12 07:43:26,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:43:27,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:43:27,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2024-11-12 07:43:27,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3677aba5/f5f3c71964b0410b99af2eab96c305a1/FLAG628359ba6 [2024-11-12 07:43:27,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3677aba5/f5f3c71964b0410b99af2eab96c305a1 [2024-11-12 07:43:27,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:43:27,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:43:27,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:43:27,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:43:27,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:43:27,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ea0f7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27, skipping insertion in model container [2024-11-12 07:43:27,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:43:27,777 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_variablewrapping_wrapper-s_file-62.i[916,929] [2024-11-12 07:43:27,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:43:27,835 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:43:27,845 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_variablewrapping_wrapper-s_file-62.i[916,929] [2024-11-12 07:43:27,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:43:27,885 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:43:27,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27 WrapperNode [2024-11-12 07:43:27,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:43:27,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:43:27,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:43:27,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:43:27,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,939 INFO L138 Inliner]: procedures = 27, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 323 [2024-11-12 07:43:27,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:43:27,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:43:27,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:43:27,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:43:27,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,990 INFO L175 MemorySlicer]: Split 88 memory accesses to 2 slices as follows [2, 86]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 25 writes are split as follows [0, 25]. [2024-11-12 07:43:27,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:27,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:28,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:28,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:28,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:28,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:28,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:43:28,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:43:28,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:43:28,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:43:28,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (1/1) ... [2024-11-12 07:43:28,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:43:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:43:28,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:43:28,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:43:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:43:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-12 07:43:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-12 07:43:28,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:43:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:43:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:43:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:43:28,097 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:43:28,097 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:43:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:43:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:43:28,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:43:28,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:43:28,175 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:43:28,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:43:28,454 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-12 07:43:28,454 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:43:28,465 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:43:28,466 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:43:28,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:43:28 BoogieIcfgContainer [2024-11-12 07:43:28,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:43:28,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:43:28,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:43:28,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:43:28,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:43:27" (1/3) ... [2024-11-12 07:43:28,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57013b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:43:28, skipping insertion in model container [2024-11-12 07:43:28,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:43:27" (2/3) ... [2024-11-12 07:43:28,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57013b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:43:28, skipping insertion in model container [2024-11-12 07:43:28,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:43:28" (3/3) ... [2024-11-12 07:43:28,474 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-62.i [2024-11-12 07:43:28,495 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:43:28,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:43:28,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:43:28,565 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;@44d32406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:43:28,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:43:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:43:28,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:28,578 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:28,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -256564704, now seen corresponding path program 1 times [2024-11-12 07:43:28,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:28,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569623918] [2024-11-12 07:43:28,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:28,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:28,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569623918] [2024-11-12 07:43:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569623918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:43:28,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850639854] [2024-11-12 07:43:28,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:28,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:43:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:43:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:43:28,883 INFO L87 Difference]: Start difference. First operand has 73 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:28,945 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2024-11-12 07:43:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:43:28,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2024-11-12 07:43:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:28,990 INFO L225 Difference]: With dead ends: 139 [2024-11-12 07:43:28,994 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 07:43:28,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:43:29,005 INFO L435 NwaCegarLoop]: 97 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, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:29,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 07:43:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-12 07:43:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2024-11-12 07:43:29,038 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2024-11-12 07:43:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:29,039 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2024-11-12 07:43:29,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2024-11-12 07:43:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:43:29,041 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:29,041 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:29,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:43:29,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:29,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1770871312, now seen corresponding path program 1 times [2024-11-12 07:43:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339714055] [2024-11-12 07:43:29,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:29,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:29,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339714055] [2024-11-12 07:43:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339714055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:29,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:29,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:29,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935142657] [2024-11-12 07:43:29,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:29,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:29,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:29,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:29,263 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:29,295 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2024-11-12 07:43:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:29,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-12 07:43:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:29,299 INFO L225 Difference]: With dead ends: 138 [2024-11-12 07:43:29,299 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 07:43:29,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:29,301 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:29,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 07:43:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-12 07:43:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-12 07:43:29,311 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2024-11-12 07:43:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:29,312 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-12 07:43:29,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-12 07:43:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:43:29,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:29,314 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:43:29,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash -749088622, now seen corresponding path program 1 times [2024-11-12 07:43:29,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:29,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699421385] [2024-11-12 07:43:29,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:29,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:29,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699421385] [2024-11-12 07:43:29,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699421385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:29,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:29,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:29,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702921137] [2024-11-12 07:43:29,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:29,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:29,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:29,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:29,434 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:29,472 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2024-11-12 07:43:29,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:29,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-12 07:43:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:29,477 INFO L225 Difference]: With dead ends: 142 [2024-11-12 07:43:29,477 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 07:43:29,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:29,479 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:29,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 07:43:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-12 07:43:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-12 07:43:29,486 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2024-11-12 07:43:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:29,487 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-12 07:43:29,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-12 07:43:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 07:43:29,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:29,489 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:29,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:43:29,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:29,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash -747241580, now seen corresponding path program 1 times [2024-11-12 07:43:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:29,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315906871] [2024-11-12 07:43:29,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:29,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315906871] [2024-11-12 07:43:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315906871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:29,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:43:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606375166] [2024-11-12 07:43:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:29,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:43:29,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:43:29,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:43:29,786 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:29,895 INFO L93 Difference]: Finished difference Result 170 states and 236 transitions. [2024-11-12 07:43:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:43:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-12 07:43:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:29,897 INFO L225 Difference]: With dead ends: 170 [2024-11-12 07:43:29,897 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 07:43:29,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:29,899 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 79 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:29,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 194 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 07:43:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 73. [2024-11-12 07:43:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2024-11-12 07:43:29,904 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 73 [2024-11-12 07:43:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:29,905 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2024-11-12 07:43:29,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2024-11-12 07:43:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 07:43:29,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:29,906 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:29,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:43:29,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:29,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:29,906 INFO L85 PathProgramCache]: Analyzing trace with hash -991247921, now seen corresponding path program 1 times [2024-11-12 07:43:29,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:29,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479455692] [2024-11-12 07:43:29,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479455692] [2024-11-12 07:43:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479455692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:43:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907958184] [2024-11-12 07:43:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:30,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:43:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:30,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:43:30,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:43:30,220 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:30,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:30,529 INFO L93 Difference]: Finished difference Result 216 states and 298 transitions. [2024-11-12 07:43:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2024-11-12 07:43:30,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:30,531 INFO L225 Difference]: With dead ends: 216 [2024-11-12 07:43:30,531 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 07:43:30,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:43:30,532 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 80 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:30,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 667 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:43:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 07:43:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 83. [2024-11-12 07:43:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2024-11-12 07:43:30,545 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 75 [2024-11-12 07:43:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:30,546 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2024-11-12 07:43:30,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2024-11-12 07:43:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 07:43:30,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:30,550 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:30,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:43:30,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:30,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 184374234, now seen corresponding path program 1 times [2024-11-12 07:43:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:30,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299529545] [2024-11-12 07:43:30,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:30,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299529545] [2024-11-12 07:43:30,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299529545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:30,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880237804] [2024-11-12 07:43:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:30,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:30,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:30,691 INFO L87 Difference]: Start difference. First operand 83 states and 114 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:30,720 INFO L93 Difference]: Finished difference Result 166 states and 229 transitions. [2024-11-12 07:43:30,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:30,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2024-11-12 07:43:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:30,721 INFO L225 Difference]: With dead ends: 166 [2024-11-12 07:43:30,723 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 07:43:30,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:30,725 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:30,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 07:43:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 07:43:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-11-12 07:43:30,737 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 77 [2024-11-12 07:43:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:30,737 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-11-12 07:43:30,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-12 07:43:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 07:43:30,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:30,739 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:30,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:43:30,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:30,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash 376483499, now seen corresponding path program 1 times [2024-11-12 07:43:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905861830] [2024-11-12 07:43:30,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:30,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:31,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:31,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905861830] [2024-11-12 07:43:31,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905861830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:31,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:31,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:31,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857032577] [2024-11-12 07:43:31,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:31,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:31,392 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:31,535 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2024-11-12 07:43:31,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:31,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-11-12 07:43:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:31,536 INFO L225 Difference]: With dead ends: 202 [2024-11-12 07:43:31,536 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 07:43:31,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:43:31,537 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 45 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:31,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 323 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:31,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 07:43:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2024-11-12 07:43:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2024-11-12 07:43:31,542 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 77 [2024-11-12 07:43:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:31,542 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2024-11-12 07:43:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2024-11-12 07:43:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 07:43:31,543 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:31,543 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:31,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:43:31,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:31,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash -736098379, now seen corresponding path program 1 times [2024-11-12 07:43:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629764073] [2024-11-12 07:43:31,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:32,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:32,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629764073] [2024-11-12 07:43:32,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629764073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:32,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:32,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:32,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369758084] [2024-11-12 07:43:32,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:32,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:32,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:32,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:32,091 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:32,256 INFO L93 Difference]: Finished difference Result 202 states and 271 transitions. [2024-11-12 07:43:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:32,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-11-12 07:43:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:32,257 INFO L225 Difference]: With dead ends: 202 [2024-11-12 07:43:32,257 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 07:43:32,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:43:32,258 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 96 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:32,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 339 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 07:43:32,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2024-11-12 07:43:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:32,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2024-11-12 07:43:32,271 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 77 [2024-11-12 07:43:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:32,272 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2024-11-12 07:43:32,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2024-11-12 07:43:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:43:32,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:32,275 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:32,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:43:32,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:32,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1071179512, now seen corresponding path program 1 times [2024-11-12 07:43:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:32,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580697751] [2024-11-12 07:43:32,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:32,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:32,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580697751] [2024-11-12 07:43:32,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580697751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:32,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:32,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:32,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926983809] [2024-11-12 07:43:32,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:32,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:32,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:32,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:32,452 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:32,490 INFO L93 Difference]: Finished difference Result 173 states and 232 transitions. [2024-11-12 07:43:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:32,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-12 07:43:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:32,492 INFO L225 Difference]: With dead ends: 173 [2024-11-12 07:43:32,492 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 07:43:32,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:32,493 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:32,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:43:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 07:43:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-12 07:43:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 07:43:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2024-11-12 07:43:32,506 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 79 [2024-11-12 07:43:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:32,508 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2024-11-12 07:43:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2024-11-12 07:43:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 07:43:32,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:32,509 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:32,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:43:32,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:32,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash 818027873, now seen corresponding path program 1 times [2024-11-12 07:43:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:32,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997718647] [2024-11-12 07:43:32,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:32,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:43:33,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:33,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997718647] [2024-11-12 07:43:33,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997718647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:43:33,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041169790] [2024-11-12 07:43:33,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:33,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:43:33,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:43:33,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:43:33,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:43:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:33,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 07:43:33,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:43:33,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:43:33,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 07:43:33,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 07:43:33,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:33,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-12 07:43:33,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:33,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2024-11-12 07:43:33,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:33,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-11-12 07:43:33,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:33,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 16 [2024-11-12 07:43:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 77 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-12 07:43:33,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:43:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:43:34,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041169790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 07:43:34,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 07:43:34,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 25 [2024-11-12 07:43:34,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271300609] [2024-11-12 07:43:34,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 07:43:34,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 07:43:34,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:34,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 07:43:34,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-12 07:43:34,020 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 25 states, 21 states have (on average 4.238095238095238) internal successors, (89), 25 states have internal predecessors, (89), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-12 07:43:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:35,231 INFO L93 Difference]: Finished difference Result 461 states and 591 transitions. [2024-11-12 07:43:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-12 07:43:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.238095238095238) internal successors, (89), 25 states have internal predecessors, (89), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) Word has length 79 [2024-11-12 07:43:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:35,233 INFO L225 Difference]: With dead ends: 461 [2024-11-12 07:43:35,233 INFO L226 Difference]: Without dead ends: 377 [2024-11-12 07:43:35,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=731, Invalid=2809, Unknown=0, NotChecked=0, Total=3540 [2024-11-12 07:43:35,234 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1092 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:35,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 426 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:43:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-12 07:43:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 267. [2024-11-12 07:43:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 234 states have (on average 1.2564102564102564) internal successors, (294), 236 states have internal predecessors, (294), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 07:43:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 342 transitions. [2024-11-12 07:43:35,247 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 342 transitions. Word has length 79 [2024-11-12 07:43:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:35,247 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 342 transitions. [2024-11-12 07:43:35,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.238095238095238) internal successors, (89), 25 states have internal predecessors, (89), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-12 07:43:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 342 transitions. [2024-11-12 07:43:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:43:35,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:35,248 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:35,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:43:35,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 07:43:35,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:35,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:35,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1012296544, now seen corresponding path program 1 times [2024-11-12 07:43:35,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:35,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285853678] [2024-11-12 07:43:35,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:35,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:35,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285853678] [2024-11-12 07:43:35,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285853678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:35,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:35,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536882344] [2024-11-12 07:43:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:35,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:35,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:35,551 INFO L87 Difference]: Start difference. First operand 267 states and 342 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:35,644 INFO L93 Difference]: Finished difference Result 522 states and 665 transitions. [2024-11-12 07:43:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-12 07:43:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:35,647 INFO L225 Difference]: With dead ends: 522 [2024-11-12 07:43:35,647 INFO L226 Difference]: Without dead ends: 275 [2024-11-12 07:43:35,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:35,648 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 51 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:35,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 194 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-12 07:43:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 210. [2024-11-12 07:43:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 178 states have (on average 1.2247191011235956) internal successors, (218), 179 states have internal predecessors, (218), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:43:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 262 transitions. [2024-11-12 07:43:35,658 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 262 transitions. Word has length 80 [2024-11-12 07:43:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:35,659 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 262 transitions. [2024-11-12 07:43:35,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 262 transitions. [2024-11-12 07:43:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:43:35,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:35,660 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:35,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:43:35,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:35,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash -220227388, now seen corresponding path program 1 times [2024-11-12 07:43:35,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:35,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356730192] [2024-11-12 07:43:35,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:35,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356730192] [2024-11-12 07:43:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356730192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:35,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:35,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:35,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240026951] [2024-11-12 07:43:35,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:35,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:35,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:35,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:35,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:35,947 INFO L87 Difference]: Start difference. First operand 210 states and 262 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:36,077 INFO L93 Difference]: Finished difference Result 508 states and 634 transitions. [2024-11-12 07:43:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:36,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-12 07:43:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:36,078 INFO L225 Difference]: With dead ends: 508 [2024-11-12 07:43:36,078 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 07:43:36,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:43:36,079 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:36,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 326 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 07:43:36,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 228. [2024-11-12 07:43:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 196 states have (on average 1.2244897959183674) internal successors, (240), 197 states have internal predecessors, (240), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:43:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 284 transitions. [2024-11-12 07:43:36,090 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 284 transitions. Word has length 80 [2024-11-12 07:43:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:36,094 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 284 transitions. [2024-11-12 07:43:36,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:36,094 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 284 transitions. [2024-11-12 07:43:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:43:36,095 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:36,095 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:36,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:43:36,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1059636290, now seen corresponding path program 1 times [2024-11-12 07:43:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:36,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537556038] [2024-11-12 07:43:36,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:43:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537556038] [2024-11-12 07:43:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537556038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:43:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417580634] [2024-11-12 07:43:36,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:36,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:43:36,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:43:36,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:43:36,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 07:43:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:37,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 07:43:37,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:43:37,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 55 [2024-11-12 07:43:37,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:37,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2024-11-12 07:43:37,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:43:37,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 105 treesize of output 45 [2024-11-12 07:43:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-12 07:43:37,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:43:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417580634] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:43:37,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:43:37,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 12] total 25 [2024-11-12 07:43:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245804282] [2024-11-12 07:43:37,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:37,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:43:37,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:37,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:43:37,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2024-11-12 07:43:37,554 INFO L87 Difference]: Start difference. First operand 228 states and 284 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:37,977 INFO L93 Difference]: Finished difference Result 526 states and 654 transitions. [2024-11-12 07:43:37,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:43:37,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-12 07:43:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:37,982 INFO L225 Difference]: With dead ends: 526 [2024-11-12 07:43:37,982 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 07:43:37,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2024-11-12 07:43:37,983 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:37,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 750 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:43:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 07:43:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 230. [2024-11-12 07:43:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 199 states have internal predecessors, (242), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:43:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2024-11-12 07:43:37,996 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 80 [2024-11-12 07:43:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:37,996 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2024-11-12 07:43:37,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2024-11-12 07:43:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:43:37,998 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:37,998 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:38,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 07:43:38,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 07:43:38,200 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:38,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2025665722, now seen corresponding path program 1 times [2024-11-12 07:43:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41133447] [2024-11-12 07:43:38,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41133447] [2024-11-12 07:43:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41133447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:39,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:39,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 07:43:39,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166527636] [2024-11-12 07:43:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 07:43:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:39,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 07:43:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:43:39,411 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:40,684 INFO L93 Difference]: Finished difference Result 725 states and 891 transitions. [2024-11-12 07:43:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 07:43:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2024-11-12 07:43:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:40,686 INFO L225 Difference]: With dead ends: 725 [2024-11-12 07:43:40,686 INFO L226 Difference]: Without dead ends: 515 [2024-11-12 07:43:40,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 07:43:40,688 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 554 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:40,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 766 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:43:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-12 07:43:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 246. [2024-11-12 07:43:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.233644859813084) internal successors, (264), 215 states have internal predecessors, (264), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:43:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 308 transitions. [2024-11-12 07:43:40,704 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 308 transitions. Word has length 80 [2024-11-12 07:43:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:40,705 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 308 transitions. [2024-11-12 07:43:40,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 308 transitions. [2024-11-12 07:43:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 07:43:40,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:40,706 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:40,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:43:40,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:40,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash -745802044, now seen corresponding path program 1 times [2024-11-12 07:43:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:40,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097848968] [2024-11-12 07:43:40,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:40,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097848968] [2024-11-12 07:43:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097848968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:40,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:40,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:40,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109909393] [2024-11-12 07:43:40,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:40,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:40,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:40,952 INFO L87 Difference]: Start difference. First operand 246 states and 308 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:41,205 INFO L93 Difference]: Finished difference Result 562 states and 700 transitions. [2024-11-12 07:43:41,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2024-11-12 07:43:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:41,207 INFO L225 Difference]: With dead ends: 562 [2024-11-12 07:43:41,207 INFO L226 Difference]: Without dead ends: 336 [2024-11-12 07:43:41,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:43:41,208 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 50 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:41,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 360 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:43:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-12 07:43:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 246. [2024-11-12 07:43:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 214 states have (on average 1.2149532710280373) internal successors, (260), 215 states have internal predecessors, (260), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:43:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 304 transitions. [2024-11-12 07:43:41,219 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 304 transitions. Word has length 80 [2024-11-12 07:43:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:41,220 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 304 transitions. [2024-11-12 07:43:41,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2024-11-12 07:43:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 07:43:41,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:41,220 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:41,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:43:41,221 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:41,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1128585064, now seen corresponding path program 1 times [2024-11-12 07:43:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344326325] [2024-11-12 07:43:41,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:41,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344326325] [2024-11-12 07:43:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344326325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:42,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:42,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 07:43:42,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966432920] [2024-11-12 07:43:42,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:42,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 07:43:42,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:42,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 07:43:42,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:43:42,176 INFO L87 Difference]: Start difference. First operand 246 states and 304 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:43,184 INFO L93 Difference]: Finished difference Result 710 states and 867 transitions. [2024-11-12 07:43:43,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 07:43:43,185 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2024-11-12 07:43:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:43,187 INFO L225 Difference]: With dead ends: 710 [2024-11-12 07:43:43,187 INFO L226 Difference]: Without dead ends: 484 [2024-11-12 07:43:43,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 07:43:43,188 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 456 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:43,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1076 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:43:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-12 07:43:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 233. [2024-11-12 07:43:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 201 states have (on average 1.208955223880597) internal successors, (243), 202 states have internal predecessors, (243), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:43:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 287 transitions. [2024-11-12 07:43:43,205 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 287 transitions. Word has length 81 [2024-11-12 07:43:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:43,205 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 287 transitions. [2024-11-12 07:43:43,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 287 transitions. [2024-11-12 07:43:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 07:43:43,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:43,206 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:43,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:43:43,206 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:43,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1390319778, now seen corresponding path program 1 times [2024-11-12 07:43:43,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002167131] [2024-11-12 07:43:43,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:43,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:43,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002167131] [2024-11-12 07:43:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002167131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:43,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:43,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:43,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742499585] [2024-11-12 07:43:43,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:43,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:43,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:43,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:43,289 INFO L87 Difference]: Start difference. First operand 233 states and 287 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:43,405 INFO L93 Difference]: Finished difference Result 546 states and 667 transitions. [2024-11-12 07:43:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2024-11-12 07:43:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:43,407 INFO L225 Difference]: With dead ends: 546 [2024-11-12 07:43:43,407 INFO L226 Difference]: Without dead ends: 327 [2024-11-12 07:43:43,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:43,408 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:43,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 329 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-12 07:43:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 233. [2024-11-12 07:43:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 201 states have (on average 1.199004975124378) internal successors, (241), 202 states have internal predecessors, (241), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 07:43:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-11-12 07:43:43,420 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 82 [2024-11-12 07:43:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:43,420 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-11-12 07:43:43,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-11-12 07:43:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 07:43:43,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:43,421 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:43:43,421 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1196454200, now seen corresponding path program 1 times [2024-11-12 07:43:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309616493] [2024-11-12 07:43:43,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309616493] [2024-11-12 07:43:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309616493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 07:43:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942897968] [2024-11-12 07:43:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 07:43:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:43,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 07:43:43,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:43:43,815 INFO L87 Difference]: Start difference. First operand 233 states and 285 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:44,052 INFO L93 Difference]: Finished difference Result 531 states and 643 transitions. [2024-11-12 07:43:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 07:43:44,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-11-12 07:43:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:44,054 INFO L225 Difference]: With dead ends: 531 [2024-11-12 07:43:44,054 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 07:43:44,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:43:44,056 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 53 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:44,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 679 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:43:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 07:43:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 303. [2024-11-12 07:43:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 264 states have (on average 1.1893939393939394) internal successors, (314), 266 states have internal predecessors, (314), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:43:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2024-11-12 07:43:44,069 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 83 [2024-11-12 07:43:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:44,069 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2024-11-12 07:43:44,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-12 07:43:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2024-11-12 07:43:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 07:43:44,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:44,070 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:44,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:43:44,071 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:44,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1363545628, now seen corresponding path program 1 times [2024-11-12 07:43:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498814267] [2024-11-12 07:43:44,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:44,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:44,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498814267] [2024-11-12 07:43:44,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498814267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641207399] [2024-11-12 07:43:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:44,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:44,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:44,302 INFO L87 Difference]: Start difference. First operand 303 states and 366 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:44,426 INFO L93 Difference]: Finished difference Result 685 states and 832 transitions. [2024-11-12 07:43:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2024-11-12 07:43:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:44,431 INFO L225 Difference]: With dead ends: 685 [2024-11-12 07:43:44,431 INFO L226 Difference]: Without dead ends: 406 [2024-11-12 07:43:44,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:44,432 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 34 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:44,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 242 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-12 07:43:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 318. [2024-11-12 07:43:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 279 states have (on average 1.17921146953405) internal successors, (329), 281 states have internal predecessors, (329), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:43:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 381 transitions. [2024-11-12 07:43:44,453 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 381 transitions. Word has length 83 [2024-11-12 07:43:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:44,454 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 381 transitions. [2024-11-12 07:43:44,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 381 transitions. [2024-11-12 07:43:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 07:43:44,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:44,455 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:44,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:43:44,455 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:44,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -608984134, now seen corresponding path program 1 times [2024-11-12 07:43:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:44,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507576042] [2024-11-12 07:43:44,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:44,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:44,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:44,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507576042] [2024-11-12 07:43:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507576042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:44,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342840749] [2024-11-12 07:43:44,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:44,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:44,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:44,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:44,537 INFO L87 Difference]: Start difference. First operand 318 states and 381 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:44,661 INFO L93 Difference]: Finished difference Result 714 states and 855 transitions. [2024-11-12 07:43:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2024-11-12 07:43:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:44,662 INFO L225 Difference]: With dead ends: 714 [2024-11-12 07:43:44,663 INFO L226 Difference]: Without dead ends: 420 [2024-11-12 07:43:44,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:44,663 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 44 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:44,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 356 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-12 07:43:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 352. [2024-11-12 07:43:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 313 states have (on average 1.1693290734824282) internal successors, (366), 315 states have internal predecessors, (366), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 07:43:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 418 transitions. [2024-11-12 07:43:44,678 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 418 transitions. Word has length 83 [2024-11-12 07:43:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:44,678 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 418 transitions. [2024-11-12 07:43:44,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 418 transitions. [2024-11-12 07:43:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 07:43:44,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:44,679 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:44,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 07:43:44,680 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1530700993, now seen corresponding path program 1 times [2024-11-12 07:43:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740366634] [2024-11-12 07:43:44,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:45,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:45,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740366634] [2024-11-12 07:43:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740366634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:45,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:45,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:43:45,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285552798] [2024-11-12 07:43:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:45,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:43:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:43:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:43:45,335 INFO L87 Difference]: Start difference. First operand 352 states and 418 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:45,633 INFO L93 Difference]: Finished difference Result 380 states and 451 transitions. [2024-11-12 07:43:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:43:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-11-12 07:43:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:45,636 INFO L225 Difference]: With dead ends: 380 [2024-11-12 07:43:45,636 INFO L226 Difference]: Without dead ends: 378 [2024-11-12 07:43:45,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:43:45,637 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 60 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:45,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 350 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:43:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-12 07:43:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2024-11-12 07:43:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 330 states have (on average 1.1606060606060606) internal successors, (383), 332 states have internal predecessors, (383), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 07:43:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 439 transitions. [2024-11-12 07:43:45,664 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 439 transitions. Word has length 85 [2024-11-12 07:43:45,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:45,664 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 439 transitions. [2024-11-12 07:43:45,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 439 transitions. [2024-11-12 07:43:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 07:43:45,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:45,666 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:45,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:43:45,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:45,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1528853951, now seen corresponding path program 1 times [2024-11-12 07:43:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:45,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785347314] [2024-11-12 07:43:45,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:43:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:43:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:43:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:43:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:43:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:43:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:43:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:43:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:43:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-12 07:43:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:43:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785347314] [2024-11-12 07:43:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785347314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:43:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:43:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:43:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36193192] [2024-11-12 07:43:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:43:45,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:43:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:43:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:43:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:43:45,832 INFO L87 Difference]: Start difference. First operand 373 states and 439 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:43:45,937 INFO L93 Difference]: Finished difference Result 710 states and 838 transitions. [2024-11-12 07:43:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:43:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2024-11-12 07:43:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:43:45,939 INFO L225 Difference]: With dead ends: 710 [2024-11-12 07:43:45,939 INFO L226 Difference]: Without dead ends: 373 [2024-11-12 07:43:45,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:43:45,940 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:43:45,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 273 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:43:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-12 07:43:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-12 07:43:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 330 states have (on average 1.1515151515151516) internal successors, (380), 332 states have internal predecessors, (380), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 07:43:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 436 transitions. [2024-11-12 07:43:45,969 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 436 transitions. Word has length 85 [2024-11-12 07:43:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:43:45,969 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 436 transitions. [2024-11-12 07:43:45,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-12 07:43:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 436 transitions. [2024-11-12 07:43:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 07:43:45,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:43:45,970 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:43:45,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 07:43:45,971 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:43:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:43:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash 246153411, now seen corresponding path program 1 times [2024-11-12 07:43:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:43:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406454097] [2024-11-12 07:43:45,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:43:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:43:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat