./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-27.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-sp_file-27.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 cdeaaf68ec6b818190b10daa08c2d0ca8b7505d1cb1ac039886c6ec324698b15 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:49:54,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:49:54,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:49:54,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:49:54,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:49:54,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:49:54,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:49:54,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:49:54,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:49:54,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:49:54,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:49:54,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:49:54,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:49:54,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:49:54,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:49:54,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:49:54,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:49:54,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:49:54,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:49:54,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:49:54,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:49:54,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:49:54,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:49:54,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:49:54,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:49:54,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:49:54,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:49:54,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:49:54,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:49:54,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:49:54,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:49:54,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:49:54,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:49:54,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:49:54,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:49:54,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:49:54,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:49:54,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:49:54,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:49:54,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:49:54,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:49:54,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:49:54,824 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 -> cdeaaf68ec6b818190b10daa08c2d0ca8b7505d1cb1ac039886c6ec324698b15 [2024-11-12 07:49:55,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:49:55,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:49:55,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:49:55,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:49:55,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:49:55,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-27.i [2024-11-12 07:49:56,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:49:56,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:49:56,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-27.i [2024-11-12 07:49:56,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59877d655/52ad1957f053423e867a76bb7ffac155/FLAGf3e2da984 [2024-11-12 07:49:57,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59877d655/52ad1957f053423e867a76bb7ffac155 [2024-11-12 07:49:57,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:49:57,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:49:57,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:49:57,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:49:57,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:49:57,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598b2a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57, skipping insertion in model container [2024-11-12 07:49:57,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:49:57,416 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-sp_file-27.i[917,930] [2024-11-12 07:49:57,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:49:57,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:49:57,493 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-sp_file-27.i[917,930] [2024-11-12 07:49:57,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:49:57,550 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:49:57,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57 WrapperNode [2024-11-12 07:49:57,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:49:57,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:49:57,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:49:57,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:49:57,558 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:49:57" (1/1) ... [2024-11-12 07:49:57,570 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:49:57" (1/1) ... [2024-11-12 07:49:57,613 INFO L138 Inliner]: procedures = 27, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2024-11-12 07:49:57,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:49:57,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:49:57,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:49:57,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:49:57,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,660 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2024-11-12 07:49:57,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:49:57,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:49:57,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:49:57,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:49:57,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (1/1) ... [2024-11-12 07:49:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:49:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:49:57,731 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:49:57,737 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:49:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:49:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-12 07:49:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-12 07:49:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:49:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:49:57,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:49:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:49:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:49:57,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:49:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:49:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:49:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:49:57,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:49:57,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:49:57,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:49:58,418 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-12 07:49:58,419 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:49:58,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:49:58,438 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:49:58,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:49:58 BoogieIcfgContainer [2024-11-12 07:49:58,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:49:58,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:49:58,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:49:58,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:49:58,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:49:57" (1/3) ... [2024-11-12 07:49:58,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70517be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:49:58, skipping insertion in model container [2024-11-12 07:49:58,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:49:57" (2/3) ... [2024-11-12 07:49:58,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70517be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:49:58, skipping insertion in model container [2024-11-12 07:49:58,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:49:58" (3/3) ... [2024-11-12 07:49:58,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-27.i [2024-11-12 07:49:58,461 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:49:58,461 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:49:58,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:49:58,520 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;@38304d04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:49:58,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:49:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 75 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:49:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:49:58,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:49:58,534 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:58,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:49:58,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:49:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -669687425, now seen corresponding path program 1 times [2024-11-12 07:49:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:49:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73992033] [2024-11-12 07:49:58,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:49:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:49:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:49:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:49:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:49:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:49:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:49:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:49:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:49:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:49:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:49:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:49:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:49:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:49:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:49:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:49:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:49:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:49:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:49:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:49:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:49:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:49:59,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73992033] [2024-11-12 07:49:59,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73992033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:49:59,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:49:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:49:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446500355] [2024-11-12 07:49:59,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:49:59,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:49:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:49:59,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:49:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:49:59,057 INFO L87 Difference]: Start difference. First operand has 94 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 75 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:49:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:49:59,090 INFO L93 Difference]: Finished difference Result 181 states and 283 transitions. [2024-11-12 07:49:59,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:49:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-11-12 07:49:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:49:59,101 INFO L225 Difference]: With dead ends: 181 [2024-11-12 07:49:59,102 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 07:49:59,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:49:59,111 INFO L435 NwaCegarLoop]: 129 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, 129 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:49:59,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:49:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 07:49:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-12 07:49:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:49:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-12 07:49:59,156 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 131 [2024-11-12 07:49:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:49:59,157 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-12 07:49:59,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:49:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-12 07:49:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:49:59,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:49:59,162 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:59,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:49:59,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:49:59,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:49:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1314658275, now seen corresponding path program 1 times [2024-11-12 07:49:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:49:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904315640] [2024-11-12 07:49:59,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:49:59,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:49:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904315640] [2024-11-12 07:50:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904315640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:01,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:01,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:50:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175727032] [2024-11-12 07:50:01,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:01,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:50:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:50:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:50:01,333 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:01,708 INFO L93 Difference]: Finished difference Result 229 states and 330 transitions. [2024-11-12 07:50:01,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:50:01,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2024-11-12 07:50:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:01,712 INFO L225 Difference]: With dead ends: 229 [2024-11-12 07:50:01,713 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 07:50:01,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:50:01,716 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:01,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 326 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:50:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 07:50:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-12 07:50:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 101 states have internal predecessors, (129), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 197 transitions. [2024-11-12 07:50:01,748 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 197 transitions. Word has length 131 [2024-11-12 07:50:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:01,750 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 197 transitions. [2024-11-12 07:50:01,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 197 transitions. [2024-11-12 07:50:01,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:50:01,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:01,753 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:01,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:50:01,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:01,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash 374285467, now seen corresponding path program 1 times [2024-11-12 07:50:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420958916] [2024-11-12 07:50:01,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:04,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420958916] [2024-11-12 07:50:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420958916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:50:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731612148] [2024-11-12 07:50:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:04,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:50:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:04,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:50:04,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:50:04,852 INFO L87 Difference]: Start difference. First operand 138 states and 197 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:05,685 INFO L93 Difference]: Finished difference Result 264 states and 379 transitions. [2024-11-12 07:50:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:50:05,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 131 [2024-11-12 07:50:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:05,688 INFO L225 Difference]: With dead ends: 264 [2024-11-12 07:50:05,688 INFO L226 Difference]: Without dead ends: 177 [2024-11-12 07:50:05,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-11-12 07:50:05,693 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 486 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:05,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 371 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:50:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-12 07:50:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 147. [2024-11-12 07:50:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 110 states have (on average 1.290909090909091) internal successors, (142), 110 states have internal predecessors, (142), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 210 transitions. [2024-11-12 07:50:05,742 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 210 transitions. Word has length 131 [2024-11-12 07:50:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:05,743 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 210 transitions. [2024-11-12 07:50:05,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 210 transitions. [2024-11-12 07:50:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:50:05,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:05,748 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:50:05,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:05,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:05,749 INFO L85 PathProgramCache]: Analyzing trace with hash -674347784, now seen corresponding path program 1 times [2024-11-12 07:50:05,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:05,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772180460] [2024-11-12 07:50:05,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772180460] [2024-11-12 07:50:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772180460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:07,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:50:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012404641] [2024-11-12 07:50:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:50:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:50:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:50:07,507 INFO L87 Difference]: Start difference. First operand 147 states and 210 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:07,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:07,987 INFO L93 Difference]: Finished difference Result 337 states and 486 transitions. [2024-11-12 07:50:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:50:07,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 133 [2024-11-12 07:50:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:07,991 INFO L225 Difference]: With dead ends: 337 [2024-11-12 07:50:07,992 INFO L226 Difference]: Without dead ends: 241 [2024-11-12 07:50:07,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:50:07,994 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 87 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:07,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 565 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:50:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-12 07:50:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2024-11-12 07:50:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 175 states have internal predecessors, (229), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-12 07:50:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 331 transitions. [2024-11-12 07:50:08,058 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 331 transitions. Word has length 133 [2024-11-12 07:50:08,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:08,059 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 331 transitions. [2024-11-12 07:50:08,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 331 transitions. [2024-11-12 07:50:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:50:08,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:08,065 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:50:08,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:08,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1097049610, now seen corresponding path program 1 times [2024-11-12 07:50:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861408027] [2024-11-12 07:50:08,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861408027] [2024-11-12 07:50:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861408027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:50:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760442171] [2024-11-12 07:50:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:50:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:50:08,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:50:08,797 INFO L87 Difference]: Start difference. First operand 230 states and 331 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:09,245 INFO L93 Difference]: Finished difference Result 391 states and 563 transitions. [2024-11-12 07:50:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:50:09,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-11-12 07:50:09,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:09,250 INFO L225 Difference]: With dead ends: 391 [2024-11-12 07:50:09,250 INFO L226 Difference]: Without dead ends: 295 [2024-11-12 07:50:09,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:50:09,253 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 175 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:09,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 394 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:50:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-12 07:50:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 230. [2024-11-12 07:50:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 175 states have (on average 1.302857142857143) internal successors, (228), 175 states have internal predecessors, (228), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-12 07:50:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 330 transitions. [2024-11-12 07:50:09,305 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 330 transitions. Word has length 133 [2024-11-12 07:50:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 330 transitions. [2024-11-12 07:50:09,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 330 transitions. [2024-11-12 07:50:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:50:09,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:09,310 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:50:09,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:09,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash -421982218, now seen corresponding path program 1 times [2024-11-12 07:50:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:09,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97663819] [2024-11-12 07:50:09,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97663819] [2024-11-12 07:50:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97663819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:09,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:09,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:50:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802775462] [2024-11-12 07:50:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:09,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:50:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:50:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:50:09,954 INFO L87 Difference]: Start difference. First operand 230 states and 330 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:10,328 INFO L93 Difference]: Finished difference Result 442 states and 635 transitions. [2024-11-12 07:50:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:50:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-11-12 07:50:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:10,332 INFO L225 Difference]: With dead ends: 442 [2024-11-12 07:50:10,332 INFO L226 Difference]: Without dead ends: 256 [2024-11-12 07:50:10,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:50:10,334 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 206 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:10,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 294 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:50:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-12 07:50:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 182. [2024-11-12 07:50:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 260 transitions. [2024-11-12 07:50:10,368 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 260 transitions. Word has length 133 [2024-11-12 07:50:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:10,369 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 260 transitions. [2024-11-12 07:50:10,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 260 transitions. [2024-11-12 07:50:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:50:10,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:10,371 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:50:10,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:10,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -927195155, now seen corresponding path program 1 times [2024-11-12 07:50:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:10,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701830927] [2024-11-12 07:50:10,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701830927] [2024-11-12 07:50:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701830927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:10,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:50:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706015896] [2024-11-12 07:50:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:50:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:50:10,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:50:10,476 INFO L87 Difference]: Start difference. First operand 182 states and 260 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:10,515 INFO L93 Difference]: Finished difference Result 363 states and 521 transitions. [2024-11-12 07:50:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:50:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-12 07:50:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:10,519 INFO L225 Difference]: With dead ends: 363 [2024-11-12 07:50:10,519 INFO L226 Difference]: Without dead ends: 184 [2024-11-12 07:50:10,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:50:10,520 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:10,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:50:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-12 07:50:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-12 07:50:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 147 states have internal predecessors, (194), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 262 transitions. [2024-11-12 07:50:10,552 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 262 transitions. Word has length 134 [2024-11-12 07:50:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:10,552 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 262 transitions. [2024-11-12 07:50:10,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 262 transitions. [2024-11-12 07:50:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:50:10,555 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:10,555 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:50:10,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:10,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -534168145, now seen corresponding path program 1 times [2024-11-12 07:50:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:10,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231550052] [2024-11-12 07:50:10,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:11,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231550052] [2024-11-12 07:50:11,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231550052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:11,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:11,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:50:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030531011] [2024-11-12 07:50:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:11,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:50:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:50:11,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:50:11,063 INFO L87 Difference]: Start difference. First operand 184 states and 262 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:11,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:11,355 INFO L93 Difference]: Finished difference Result 431 states and 612 transitions. [2024-11-12 07:50:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:50:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-12 07:50:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:11,357 INFO L225 Difference]: With dead ends: 431 [2024-11-12 07:50:11,358 INFO L226 Difference]: Without dead ends: 250 [2024-11-12 07:50:11,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:50:11,360 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 163 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:11,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 264 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:50:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-12 07:50:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 202. [2024-11-12 07:50:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 165 states have (on average 1.309090909090909) internal successors, (216), 165 states have internal predecessors, (216), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 284 transitions. [2024-11-12 07:50:11,389 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 284 transitions. Word has length 134 [2024-11-12 07:50:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 284 transitions. [2024-11-12 07:50:11,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 284 transitions. [2024-11-12 07:50:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:50:11,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:11,393 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:11,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:50:11,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:11,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash -226130577, now seen corresponding path program 1 times [2024-11-12 07:50:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692633735] [2024-11-12 07:50:11,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:11,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:11,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692633735] [2024-11-12 07:50:11,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692633735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:11,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:50:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887336931] [2024-11-12 07:50:11,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:11,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:50:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:11,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:50:11,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:50:11,569 INFO L87 Difference]: Start difference. First operand 202 states and 284 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:11,614 INFO L93 Difference]: Finished difference Result 407 states and 573 transitions. [2024-11-12 07:50:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:50:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-12 07:50:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:11,616 INFO L225 Difference]: With dead ends: 407 [2024-11-12 07:50:11,616 INFO L226 Difference]: Without dead ends: 208 [2024-11-12 07:50:11,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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:50:11,617 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 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:50:11,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:50:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-12 07:50:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-12 07:50:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 171 states have (on average 1.2982456140350878) internal successors, (222), 171 states have internal predecessors, (222), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 290 transitions. [2024-11-12 07:50:11,645 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 290 transitions. Word has length 134 [2024-11-12 07:50:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:11,646 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 290 transitions. [2024-11-12 07:50:11,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 290 transitions. [2024-11-12 07:50:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 07:50:11,647 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:11,647 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:11,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:50:11,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:11,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 166896433, now seen corresponding path program 1 times [2024-11-12 07:50:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003702616] [2024-11-12 07:50:11,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:12,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003702616] [2024-11-12 07:50:12,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003702616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:50:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411118035] [2024-11-12 07:50:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:12,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:50:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:12,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:50:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:50:12,926 INFO L87 Difference]: Start difference. First operand 208 states and 290 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:13,513 INFO L93 Difference]: Finished difference Result 333 states and 466 transitions. [2024-11-12 07:50:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:50:13,514 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2024-11-12 07:50:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:13,516 INFO L225 Difference]: With dead ends: 333 [2024-11-12 07:50:13,516 INFO L226 Difference]: Without dead ends: 222 [2024-11-12 07:50:13,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:50:13,517 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 191 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:13,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 295 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:50:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-12 07:50:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2024-11-12 07:50:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 183 states have (on average 1.3005464480874316) internal successors, (238), 183 states have internal predecessors, (238), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 306 transitions. [2024-11-12 07:50:13,555 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 306 transitions. Word has length 134 [2024-11-12 07:50:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:13,558 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 306 transitions. [2024-11-12 07:50:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 306 transitions. [2024-11-12 07:50:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:13,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:13,560 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:13,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:50:13,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:13,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:13,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1652175007, now seen corresponding path program 1 times [2024-11-12 07:50:13,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:13,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805513714] [2024-11-12 07:50:13,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:13,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:15,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:15,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805513714] [2024-11-12 07:50:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805513714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:50:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556404295] [2024-11-12 07:50:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:15,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:50:15,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:15,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:50:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:50:15,496 INFO L87 Difference]: Start difference. First operand 220 states and 306 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:16,391 INFO L93 Difference]: Finished difference Result 353 states and 491 transitions. [2024-11-12 07:50:16,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:50:16,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 135 [2024-11-12 07:50:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:16,395 INFO L225 Difference]: With dead ends: 353 [2024-11-12 07:50:16,395 INFO L226 Difference]: Without dead ends: 230 [2024-11-12 07:50:16,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:50:16,396 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 183 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:16,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 360 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:50:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-12 07:50:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2024-11-12 07:50:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 188 states have (on average 1.297872340425532) internal successors, (244), 188 states have internal predecessors, (244), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:16,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 312 transitions. [2024-11-12 07:50:16,428 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 312 transitions. Word has length 135 [2024-11-12 07:50:16,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 312 transitions. [2024-11-12 07:50:16,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 13 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:16,429 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 312 transitions. [2024-11-12 07:50:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:16,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:16,430 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:16,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:50:16,431 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:16,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash -341969699, now seen corresponding path program 1 times [2024-11-12 07:50:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:16,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139888712] [2024-11-12 07:50:16,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139888712] [2024-11-12 07:50:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139888712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:50:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065017895] [2024-11-12 07:50:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:17,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:50:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:50:17,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:50:17,493 INFO L87 Difference]: Start difference. First operand 225 states and 312 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:17,976 INFO L93 Difference]: Finished difference Result 497 states and 695 transitions. [2024-11-12 07:50:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:50:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-11-12 07:50:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:17,979 INFO L225 Difference]: With dead ends: 497 [2024-11-12 07:50:17,979 INFO L226 Difference]: Without dead ends: 275 [2024-11-12 07:50:17,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:50:17,981 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 153 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:17,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 215 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:50:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-12 07:50:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 248. [2024-11-12 07:50:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 211 states have (on average 1.3127962085308056) internal successors, (277), 211 states have internal predecessors, (277), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 345 transitions. [2024-11-12 07:50:18,016 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 345 transitions. Word has length 135 [2024-11-12 07:50:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:18,017 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 345 transitions. [2024-11-12 07:50:18,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 345 transitions. [2024-11-12 07:50:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:18,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:18,019 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:18,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:50:18,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:18,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1708220221, now seen corresponding path program 1 times [2024-11-12 07:50:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405289624] [2024-11-12 07:50:18,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405289624] [2024-11-12 07:50:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405289624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:21,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:50:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492001291] [2024-11-12 07:50:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:21,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:50:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:50:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:50:21,437 INFO L87 Difference]: Start difference. First operand 248 states and 345 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:22,669 INFO L93 Difference]: Finished difference Result 658 states and 913 transitions. [2024-11-12 07:50:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:50:22,670 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-11-12 07:50:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:22,673 INFO L225 Difference]: With dead ends: 658 [2024-11-12 07:50:22,673 INFO L226 Difference]: Without dead ends: 413 [2024-11-12 07:50:22,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:50:22,674 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 318 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:22,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 458 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:50:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-12 07:50:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 357. [2024-11-12 07:50:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 320 states have (on average 1.3375) internal successors, (428), 320 states have internal predecessors, (428), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 496 transitions. [2024-11-12 07:50:22,715 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 496 transitions. Word has length 135 [2024-11-12 07:50:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:22,715 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 496 transitions. [2024-11-12 07:50:22,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2024-11-12 07:50:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:22,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:22,717 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:22,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 07:50:22,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:22,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1646180607, now seen corresponding path program 1 times [2024-11-12 07:50:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:22,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300493612] [2024-11-12 07:50:22,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:22,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:22,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300493612] [2024-11-12 07:50:22,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300493612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:22,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:22,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:50:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530019799] [2024-11-12 07:50:22,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:22,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:50:22,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:50:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:50:22,795 INFO L87 Difference]: Start difference. First operand 357 states and 496 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:22,838 INFO L93 Difference]: Finished difference Result 690 states and 960 transitions. [2024-11-12 07:50:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:50:22,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-11-12 07:50:22,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:22,840 INFO L225 Difference]: With dead ends: 690 [2024-11-12 07:50:22,841 INFO L226 Difference]: Without dead ends: 336 [2024-11-12 07:50:22,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:50:22,842 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:22,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:50:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-12 07:50:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2024-11-12 07:50:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 299 states have (on average 1.3277591973244147) internal successors, (397), 299 states have internal predecessors, (397), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 465 transitions. [2024-11-12 07:50:22,883 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 465 transitions. Word has length 135 [2024-11-12 07:50:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:22,884 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 465 transitions. [2024-11-12 07:50:22,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 465 transitions. [2024-11-12 07:50:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:22,885 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:22,885 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:22,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:50:22,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1212961131, now seen corresponding path program 1 times [2024-11-12 07:50:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79780735] [2024-11-12 07:50:22,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:25,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79780735] [2024-11-12 07:50:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79780735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:25,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:25,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:50:25,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734800830] [2024-11-12 07:50:25,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:50:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:25,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:50:25,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:50:25,552 INFO L87 Difference]: Start difference. First operand 336 states and 465 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:26,565 INFO L93 Difference]: Finished difference Result 848 states and 1170 transitions. [2024-11-12 07:50:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:50:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-11-12 07:50:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:26,572 INFO L225 Difference]: With dead ends: 848 [2024-11-12 07:50:26,572 INFO L226 Difference]: Without dead ends: 515 [2024-11-12 07:50:26,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-11-12 07:50:26,575 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 170 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:26,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 538 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:50:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-12 07:50:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 415. [2024-11-12 07:50:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 378 states have (on average 1.32010582010582) internal successors, (499), 378 states have internal predecessors, (499), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 567 transitions. [2024-11-12 07:50:26,633 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 567 transitions. Word has length 135 [2024-11-12 07:50:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:26,633 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 567 transitions. [2024-11-12 07:50:26,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 567 transitions. [2024-11-12 07:50:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:26,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:26,636 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:26,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 07:50:26,636 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -954795693, now seen corresponding path program 1 times [2024-11-12 07:50:26,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:26,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789987387] [2024-11-12 07:50:26,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:26,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:29,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:29,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789987387] [2024-11-12 07:50:29,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789987387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:29,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:29,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:50:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438522664] [2024-11-12 07:50:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:29,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:50:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:50:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:50:29,003 INFO L87 Difference]: Start difference. First operand 415 states and 567 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:29,747 INFO L93 Difference]: Finished difference Result 903 states and 1232 transitions. [2024-11-12 07:50:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:50:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 135 [2024-11-12 07:50:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:29,750 INFO L225 Difference]: With dead ends: 903 [2024-11-12 07:50:29,750 INFO L226 Difference]: Without dead ends: 491 [2024-11-12 07:50:29,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:50:29,752 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 231 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:29,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 420 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:50:29,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-12 07:50:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 415. [2024-11-12 07:50:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 378 states have (on average 1.2989417989417988) internal successors, (491), 378 states have internal predecessors, (491), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 559 transitions. [2024-11-12 07:50:29,798 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 559 transitions. Word has length 135 [2024-11-12 07:50:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:29,799 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 559 transitions. [2024-11-12 07:50:29,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 559 transitions. [2024-11-12 07:50:29,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:29,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:29,801 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 07:50:29,801 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2030609581, now seen corresponding path program 1 times [2024-11-12 07:50:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774280867] [2024-11-12 07:50:29,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:31,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:31,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774280867] [2024-11-12 07:50:31,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774280867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:31,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:31,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:50:31,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439157107] [2024-11-12 07:50:31,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:31,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:50:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:50:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:50:31,787 INFO L87 Difference]: Start difference. First operand 415 states and 559 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:32,600 INFO L93 Difference]: Finished difference Result 895 states and 1208 transitions. [2024-11-12 07:50:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:50:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 135 [2024-11-12 07:50:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:32,605 INFO L225 Difference]: With dead ends: 895 [2024-11-12 07:50:32,605 INFO L226 Difference]: Without dead ends: 483 [2024-11-12 07:50:32,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:50:32,608 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 302 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:32,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 396 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:50:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-12 07:50:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 415. [2024-11-12 07:50:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 378 states have (on average 1.2777777777777777) internal successors, (483), 378 states have internal predecessors, (483), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 551 transitions. [2024-11-12 07:50:32,652 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 551 transitions. Word has length 135 [2024-11-12 07:50:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:32,652 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 551 transitions. [2024-11-12 07:50:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 551 transitions. [2024-11-12 07:50:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:32,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:32,657 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 07:50:32,657 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:32,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1772444143, now seen corresponding path program 1 times [2024-11-12 07:50:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:32,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275445742] [2024-11-12 07:50:32,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:34,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:34,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275445742] [2024-11-12 07:50:34,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275445742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:34,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:34,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 07:50:34,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505092534] [2024-11-12 07:50:34,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:34,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 07:50:34,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:34,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 07:50:34,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:50:34,396 INFO L87 Difference]: Start difference. First operand 415 states and 551 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:35,212 INFO L93 Difference]: Finished difference Result 895 states and 1192 transitions. [2024-11-12 07:50:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 07:50:35,213 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-11-12 07:50:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:35,215 INFO L225 Difference]: With dead ends: 895 [2024-11-12 07:50:35,215 INFO L226 Difference]: Without dead ends: 483 [2024-11-12 07:50:35,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-11-12 07:50:35,217 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 183 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:35,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 639 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:50:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-12 07:50:35,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 391. [2024-11-12 07:50:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 354 states have (on average 1.2740112994350283) internal successors, (451), 354 states have internal predecessors, (451), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 07:50:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 519 transitions. [2024-11-12 07:50:35,263 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 519 transitions. Word has length 135 [2024-11-12 07:50:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:35,264 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 519 transitions. [2024-11-12 07:50:35,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 519 transitions. [2024-11-12 07:50:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:35,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:35,265 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:35,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 07:50:35,265 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:35,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:35,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1643297949, now seen corresponding path program 1 times [2024-11-12 07:50:35,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:35,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849489015] [2024-11-12 07:50:35,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849489015] [2024-11-12 07:50:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849489015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:36,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:36,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:50:36,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5511953] [2024-11-12 07:50:36,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:36,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:50:36,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:36,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:50:36,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:50:36,073 INFO L87 Difference]: Start difference. First operand 391 states and 519 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:36,626 INFO L93 Difference]: Finished difference Result 873 states and 1162 transitions. [2024-11-12 07:50:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:50:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-11-12 07:50:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:36,629 INFO L225 Difference]: With dead ends: 873 [2024-11-12 07:50:36,629 INFO L226 Difference]: Without dead ends: 485 [2024-11-12 07:50:36,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:50:36,631 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 226 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:36,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 342 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:50:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-12 07:50:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 481. [2024-11-12 07:50:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 422 states have (on average 1.2630331753554502) internal successors, (533), 424 states have internal predecessors, (533), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:50:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 641 transitions. [2024-11-12 07:50:36,723 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 641 transitions. Word has length 135 [2024-11-12 07:50:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:36,724 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 641 transitions. [2024-11-12 07:50:36,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 641 transitions. [2024-11-12 07:50:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:50:36,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:36,726 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 07:50:36,726 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:36,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash 277047427, now seen corresponding path program 1 times [2024-11-12 07:50:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:36,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782714121] [2024-11-12 07:50:36,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782714121] [2024-11-12 07:50:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782714121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:50:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071426996] [2024-11-12 07:50:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:50:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:36,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:50:36,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:50:36,958 INFO L87 Difference]: Start difference. First operand 481 states and 641 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:37,189 INFO L93 Difference]: Finished difference Result 741 states and 988 transitions. [2024-11-12 07:50:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:50:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-11-12 07:50:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:37,193 INFO L225 Difference]: With dead ends: 741 [2024-11-12 07:50:37,194 INFO L226 Difference]: Without dead ends: 471 [2024-11-12 07:50:37,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:50:37,195 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 13 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:37,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 371 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:50:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-12 07:50:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 464. [2024-11-12 07:50:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 405 states have (on average 1.2567901234567902) internal successors, (509), 407 states have internal predecessors, (509), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 07:50:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 617 transitions. [2024-11-12 07:50:37,281 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 617 transitions. Word has length 135 [2024-11-12 07:50:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:37,282 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 617 transitions. [2024-11-12 07:50:37,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2024-11-12 07:50:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:50:37,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:37,283 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 07:50:37,283 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:37,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1110553815, now seen corresponding path program 1 times [2024-11-12 07:50:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:37,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121527696] [2024-11-12 07:50:37,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121527696] [2024-11-12 07:50:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121527696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:37,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:37,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:50:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830066709] [2024-11-12 07:50:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:50:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:37,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:50:37,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:50:37,997 INFO L87 Difference]: Start difference. First operand 464 states and 617 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:38,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:38,580 INFO L93 Difference]: Finished difference Result 912 states and 1216 transitions. [2024-11-12 07:50:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:50:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2024-11-12 07:50:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:38,583 INFO L225 Difference]: With dead ends: 912 [2024-11-12 07:50:38,584 INFO L226 Difference]: Without dead ends: 451 [2024-11-12 07:50:38,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:50:38,585 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 190 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:38,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 291 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:50:38,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-12 07:50:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 450. [2024-11-12 07:50:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 382 states have (on average 1.2356020942408377) internal successors, (472), 385 states have internal predecessors, (472), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:50:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 596 transitions. [2024-11-12 07:50:38,701 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 596 transitions. Word has length 136 [2024-11-12 07:50:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:38,701 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 596 transitions. [2024-11-12 07:50:38,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 596 transitions. [2024-11-12 07:50:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:50:38,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:38,703 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 07:50:38,703 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:38,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash 847971409, now seen corresponding path program 1 times [2024-11-12 07:50:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:38,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309501670] [2024-11-12 07:50:38,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309501670] [2024-11-12 07:50:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309501670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:50:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973268244] [2024-11-12 07:50:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:50:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:39,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:50:39,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:50:39,332 INFO L87 Difference]: Start difference. First operand 450 states and 596 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:50:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:39,977 INFO L93 Difference]: Finished difference Result 953 states and 1260 transitions. [2024-11-12 07:50:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:50:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-12 07:50:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:39,984 INFO L225 Difference]: With dead ends: 953 [2024-11-12 07:50:39,984 INFO L226 Difference]: Without dead ends: 527 [2024-11-12 07:50:39,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-11-12 07:50:39,987 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 188 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:39,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 421 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:50:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-12 07:50:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 505. [2024-11-12 07:50:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 437 states have (on average 1.2334096109839816) internal successors, (539), 440 states have internal predecessors, (539), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:50:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 663 transitions. [2024-11-12 07:50:40,129 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 663 transitions. Word has length 139 [2024-11-12 07:50:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:40,129 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 663 transitions. [2024-11-12 07:50:40,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:50:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 663 transitions. [2024-11-12 07:50:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:50:40,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:40,131 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 07:50:40,131 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:40,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1096577190, now seen corresponding path program 1 times [2024-11-12 07:50:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749623592] [2024-11-12 07:50:40,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:42,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749623592] [2024-11-12 07:50:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749623592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 07:50:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566766432] [2024-11-12 07:50:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:42,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 07:50:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:42,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 07:50:42,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:50:42,168 INFO L87 Difference]: Start difference. First operand 505 states and 663 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:43,369 INFO L93 Difference]: Finished difference Result 960 states and 1251 transitions. [2024-11-12 07:50:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:50:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 139 [2024-11-12 07:50:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:43,373 INFO L225 Difference]: With dead ends: 960 [2024-11-12 07:50:43,373 INFO L226 Difference]: Without dead ends: 679 [2024-11-12 07:50:43,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-12 07:50:43,374 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 269 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:43,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 407 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 07:50:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-12 07:50:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 514. [2024-11-12 07:50:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 446 states have (on average 1.2331838565022422) internal successors, (550), 449 states have internal predecessors, (550), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:50:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 674 transitions. [2024-11-12 07:50:43,453 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 674 transitions. Word has length 139 [2024-11-12 07:50:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 674 transitions. [2024-11-12 07:50:43,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-12 07:50:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 674 transitions. [2024-11-12 07:50:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:50:43,454 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:43,454 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 07:50:43,454 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:43,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1020534997, now seen corresponding path program 1 times [2024-11-12 07:50:43,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281890367] [2024-11-12 07:50:43,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:43,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:43,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281890367] [2024-11-12 07:50:43,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281890367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:43,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:50:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473945595] [2024-11-12 07:50:43,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:43,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:50:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:50:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:50:43,643 INFO L87 Difference]: Start difference. First operand 514 states and 674 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:43,839 INFO L93 Difference]: Finished difference Result 1063 states and 1393 transitions. [2024-11-12 07:50:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:50:43,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-12 07:50:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:43,842 INFO L225 Difference]: With dead ends: 1063 [2024-11-12 07:50:43,842 INFO L226 Difference]: Without dead ends: 573 [2024-11-12 07:50:43,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:50:43,844 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 59 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:43,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 310 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:50:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-12 07:50:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 525. [2024-11-12 07:50:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 457 states have (on average 1.225382932166302) internal successors, (560), 460 states have internal predecessors, (560), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:50:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 684 transitions. [2024-11-12 07:50:43,944 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 684 transitions. Word has length 139 [2024-11-12 07:50:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:43,945 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 684 transitions. [2024-11-12 07:50:43,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:50:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 684 transitions. [2024-11-12 07:50:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:50:43,946 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:43,947 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 07:50:43,947 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:43,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1329883700, now seen corresponding path program 1 times [2024-11-12 07:50:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773906745] [2024-11-12 07:50:43,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:44,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773906745] [2024-11-12 07:50:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773906745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:44,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:50:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885468195] [2024-11-12 07:50:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:44,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:50:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:44,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:50:44,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:50:44,989 INFO L87 Difference]: Start difference. First operand 525 states and 684 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:45,562 INFO L93 Difference]: Finished difference Result 1220 states and 1588 transitions. [2024-11-12 07:50:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:50:45,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2024-11-12 07:50:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:45,567 INFO L225 Difference]: With dead ends: 1220 [2024-11-12 07:50:45,567 INFO L226 Difference]: Without dead ends: 719 [2024-11-12 07:50:45,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:50:45,569 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 232 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:45,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 274 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:50:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-12 07:50:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 619. [2024-11-12 07:50:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 551 states have (on average 1.2286751361161525) internal successors, (677), 554 states have internal predecessors, (677), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:50:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 801 transitions. [2024-11-12 07:50:45,737 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 801 transitions. Word has length 139 [2024-11-12 07:50:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:45,738 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 801 transitions. [2024-11-12 07:50:45,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 801 transitions. [2024-11-12 07:50:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:50:45,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:45,740 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:45,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 07:50:45,740 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:45,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:45,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1953966346, now seen corresponding path program 1 times [2024-11-12 07:50:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:45,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631110887] [2024-11-12 07:50:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 07:50:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631110887] [2024-11-12 07:50:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631110887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:50:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920977571] [2024-11-12 07:50:46,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:46,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:50:46,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:50:46,492 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:50:46,494 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:50:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:46,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 07:50:46,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:50:47,114 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 15 treesize of output 1 [2024-11-12 07:50:47,397 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 23 treesize of output 11 [2024-11-12 07:50:47,525 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 23 treesize of output 11 [2024-11-12 07:50:47,675 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 23 treesize of output 11 [2024-11-12 07:50:47,833 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 23 treesize of output 11 [2024-11-12 07:50:47,955 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 23 treesize of output 11 [2024-11-12 07:50:48,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:50:48,208 INFO L349 Elim1Store]: treesize reduction 60, result has 41.7 percent of original size [2024-11-12 07:50:48,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 62 [2024-11-12 07:50:48,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-12 07:50:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 165 proven. 195 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-12 07:50:48,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:50:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920977571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:50:56,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:50:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-12 07:50:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984249347] [2024-11-12 07:50:56,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:50:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 07:50:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:56,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 07:50:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=340, Unknown=2, NotChecked=0, Total=420 [2024-11-12 07:50:56,468 INFO L87 Difference]: Start difference. First operand 619 states and 801 transitions. Second operand has 18 states, 16 states have (on average 6.1875) internal successors, (99), 18 states have internal predecessors, (99), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-11-12 07:50:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:57,368 INFO L93 Difference]: Finished difference Result 1018 states and 1305 transitions. [2024-11-12 07:50:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:50:57,368 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.1875) internal successors, (99), 18 states have internal predecessors, (99), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) Word has length 139 [2024-11-12 07:50:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:57,372 INFO L225 Difference]: With dead ends: 1018 [2024-11-12 07:50:57,373 INFO L226 Difference]: Without dead ends: 647 [2024-11-12 07:50:57,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=157, Invalid=491, Unknown=2, NotChecked=0, Total=650 [2024-11-12 07:50:57,375 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 120 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:57,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 370 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:50:57,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-11-12 07:50:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 624. [2024-11-12 07:50:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 551 states have (on average 1.2177858439201452) internal successors, (671), 554 states have internal predecessors, (671), 62 states have call successors, (62), 10 states have call predecessors, (62), 10 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 07:50:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 795 transitions. [2024-11-12 07:50:57,510 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 795 transitions. Word has length 139 [2024-11-12 07:50:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:57,511 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 795 transitions. [2024-11-12 07:50:57,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.1875) internal successors, (99), 18 states have internal predecessors, (99), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-11-12 07:50:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 795 transitions. [2024-11-12 07:50:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:50:57,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:57,513 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:57,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:50:57,713 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,SelfDestructingSolverStorable25 [2024-11-12 07:50:57,714 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -249593030, now seen corresponding path program 1 times [2024-11-12 07:50:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010152583] [2024-11-12 07:50:57,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:50:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:50:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:50:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:50:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:50:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:50:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:50:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:50:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:50:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:50:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:50:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:50:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:50:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:50:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:50:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:50:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:50:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:50:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:50:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:50:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010152583] [2024-11-12 07:50:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010152583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:50:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:50:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 07:50:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372273313] [2024-11-12 07:50:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:50:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 07:50:58,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:50:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 07:50:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:50:58,923 INFO L87 Difference]: Start difference. First operand 624 states and 795 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:50:59,705 INFO L93 Difference]: Finished difference Result 1190 states and 1509 transitions. [2024-11-12 07:50:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:50:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2024-11-12 07:50:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:50:59,710 INFO L225 Difference]: With dead ends: 1190 [2024-11-12 07:50:59,711 INFO L226 Difference]: Without dead ends: 826 [2024-11-12 07:50:59,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:50:59,712 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 307 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:50:59,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 303 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:50:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-12 07:50:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 822. [2024-11-12 07:50:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 738 states have (on average 1.2208672086720866) internal successors, (901), 743 states have internal predecessors, (901), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 07:50:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1041 transitions. [2024-11-12 07:50:59,874 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1041 transitions. Word has length 139 [2024-11-12 07:50:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:50:59,874 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1041 transitions. [2024-11-12 07:50:59,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-12 07:50:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1041 transitions. [2024-11-12 07:50:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 07:50:59,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:50:59,876 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:59,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 07:50:59,876 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:50:59,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:50:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash 430465340, now seen corresponding path program 1 times [2024-11-12 07:50:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:50:59,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124098597] [2024-11-12 07:50:59,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:50:59,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:50:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat