./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1733340110531036ec2730e9cf68ec8d1d2e7f12e2ee065e03b827b6d5da2aba --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:04:04,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:04:04,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:04:04,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:04:04,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:04:04,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:04:04,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:04:04,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:04:04,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:04:04,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:04:04,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:04:04,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:04:04,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:04:04,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:04:04,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:04:04,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:04:04,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:04:04,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:04:04,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:04:04,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:04:04,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:04:04,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:04:04,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:04:04,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:04:04,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:04:04,860 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:04:04,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:04:04,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:04:04,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:04:04,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:04:04,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:04:04,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:04:04,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:04,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:04:04,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:04:04,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:04:04,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:04:04,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:04:04,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:04:04,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:04:04,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:04:04,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:04:04,866 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 -> 1733340110531036ec2730e9cf68ec8d1d2e7f12e2ee065e03b827b6d5da2aba [2024-10-24 12:04:05,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:04:05,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:04:05,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:04:05,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:04:05,158 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:04:05,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-87.i [2024-10-24 12:04:06,699 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:04:06,917 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:04:06,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-87.i [2024-10-24 12:04:06,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e4f06229/2c2042f757c24dbb8bbf434861373cb7/FLAG1ee97d48b [2024-10-24 12:04:06,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e4f06229/2c2042f757c24dbb8bbf434861373cb7 [2024-10-24 12:04:06,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:04:06,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:04:06,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:06,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:04:06,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:04:06,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:06" (1/1) ... [2024-10-24 12:04:06,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6852af5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:06, skipping insertion in model container [2024-10-24 12:04:06,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:04:06" (1/1) ... [2024-10-24 12:04:06,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:04:07,182 WARN L248 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-87.i[917,930] [2024-10-24 12:04:07,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:07,297 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:04:07,311 WARN L248 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-87.i[917,930] [2024-10-24 12:04:07,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:04:07,419 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:04:07,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07 WrapperNode [2024-10-24 12:04:07,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:04:07,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:07,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:04:07,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:04:07,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,504 INFO L138 Inliner]: procedures = 26, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-10-24 12:04:07,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:04:07,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:04:07,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:04:07,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:04:07,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,570 INFO L175 MemorySlicer]: Split 119 memory accesses to 2 slices as follows [2, 117]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2024-10-24 12:04:07,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:04:07,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:04:07,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:04:07,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:04:07,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (1/1) ... [2024-10-24 12:04:07,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:04:07,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:07,641 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-10-24 12:04:07,646 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-10-24 12:04:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:04:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:04:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:04:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:04:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:04:07,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:04:07,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:04:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:04:07,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:04:07,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:04:07,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:04:07,848 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:04:07,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:04:08,422 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-24 12:04:08,422 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:04:08,478 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:04:08,478 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:04:08,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:08 BoogieIcfgContainer [2024-10-24 12:04:08,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:04:08,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:04:08,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:04:08,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:04:08,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:04:06" (1/3) ... [2024-10-24 12:04:08,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c712dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:08, skipping insertion in model container [2024-10-24 12:04:08,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:04:07" (2/3) ... [2024-10-24 12:04:08,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c712dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:04:08, skipping insertion in model container [2024-10-24 12:04:08,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:04:08" (3/3) ... [2024-10-24 12:04:08,491 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-87.i [2024-10-24 12:04:08,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:04:08,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:04:08,593 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:04:08,605 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;@27b1a168, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:04:08,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:04:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 12:04:08,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:08,626 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:08,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:08,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1663627836, now seen corresponding path program 1 times [2024-10-24 12:04:08,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:08,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296315718] [2024-10-24 12:04:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:08,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:08,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:09,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296315718] [2024-10-24 12:04:09,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296315718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:09,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:09,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:04:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051764946] [2024-10-24 12:04:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:04:09,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:04:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:04:09,130 INFO L87 Difference]: Start difference. First operand has 80 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:09,183 INFO L93 Difference]: Finished difference Result 157 states and 246 transitions. [2024-10-24 12:04:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:04:09,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2024-10-24 12:04:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:09,195 INFO L225 Difference]: With dead ends: 157 [2024-10-24 12:04:09,196 INFO L226 Difference]: Without dead ends: 78 [2024-10-24 12:04:09,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:04:09,205 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:09,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-24 12:04:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-24 12:04:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2024-10-24 12:04:09,262 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 106 [2024-10-24 12:04:09,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:09,264 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2024-10-24 12:04:09,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2024-10-24 12:04:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 12:04:09,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:09,269 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:09,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:04:09,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:09,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1681490720, now seen corresponding path program 1 times [2024-10-24 12:04:09,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137946624] [2024-10-24 12:04:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137946624] [2024-10-24 12:04:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137946624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:09,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:09,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202955960] [2024-10-24 12:04:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:09,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:09,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:09,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:09,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:09,807 INFO L87 Difference]: Start difference. First operand 78 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:09,889 INFO L93 Difference]: Finished difference Result 157 states and 222 transitions. [2024-10-24 12:04:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:09,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2024-10-24 12:04:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:09,892 INFO L225 Difference]: With dead ends: 157 [2024-10-24 12:04:09,892 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 12:04:09,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:09,895 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:09,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 305 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:04:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 12:04:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 12:04:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 112 transitions. [2024-10-24 12:04:09,909 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 112 transitions. Word has length 106 [2024-10-24 12:04:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:09,912 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 112 transitions. [2024-10-24 12:04:09,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:09,913 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2024-10-24 12:04:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:04:09,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:09,919 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:09,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:04:09,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash -321969049, now seen corresponding path program 1 times [2024-10-24 12:04:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072438648] [2024-10-24 12:04:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072438648] [2024-10-24 12:04:10,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072438648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:10,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842247498] [2024-10-24 12:04:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:10,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:10,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:10,249 INFO L87 Difference]: Start difference. First operand 80 states and 112 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:10,312 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2024-10-24 12:04:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:10,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2024-10-24 12:04:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:10,315 INFO L225 Difference]: With dead ends: 162 [2024-10-24 12:04:10,319 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 12:04:10,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:10,321 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:10,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 302 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:10,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 12:04:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-10-24 12:04:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-10-24 12:04:10,334 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 108 [2024-10-24 12:04:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:10,335 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-10-24 12:04:10,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-10-24 12:04:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:04:10,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:10,337 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:10,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:04:10,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1131315675, now seen corresponding path program 1 times [2024-10-24 12:04:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843336978] [2024-10-24 12:04:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:10,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:10,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843336978] [2024-10-24 12:04:10,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843336978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:10,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:10,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:10,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198715337] [2024-10-24 12:04:10,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:10,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:10,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:10,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:10,617 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:10,671 INFO L93 Difference]: Finished difference Result 166 states and 231 transitions. [2024-10-24 12:04:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:10,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2024-10-24 12:04:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:10,673 INFO L225 Difference]: With dead ends: 166 [2024-10-24 12:04:10,673 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 12:04:10,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:10,675 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:10,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 12:04:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-10-24 12:04:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2024-10-24 12:04:10,685 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 108 [2024-10-24 12:04:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:10,686 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2024-10-24 12:04:10,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2024-10-24 12:04:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:04:10,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:10,692 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:10,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:04:10,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1074057373, now seen corresponding path program 1 times [2024-10-24 12:04:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962242284] [2024-10-24 12:04:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962242284] [2024-10-24 12:04:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962242284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:10,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:10,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:04:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014063242] [2024-10-24 12:04:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:04:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:10,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:04:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:10,927 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:10,968 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2024-10-24 12:04:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:04:10,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2024-10-24 12:04:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:10,970 INFO L225 Difference]: With dead ends: 170 [2024-10-24 12:04:10,971 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 12:04:10,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:04:10,972 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:10,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:04:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 12:04:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-10-24 12:04:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-24 12:04:10,980 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 108 [2024-10-24 12:04:10,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:10,981 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-24 12:04:10,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-24 12:04:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:04:10,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:10,984 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:10,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:04:10,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:10,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1073997791, now seen corresponding path program 1 times [2024-10-24 12:04:10,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:10,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373201009] [2024-10-24 12:04:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373201009] [2024-10-24 12:04:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373201009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:11,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:04:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577452518] [2024-10-24 12:04:11,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:11,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:04:11,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:04:11,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:04:11,839 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:12,234 INFO L93 Difference]: Finished difference Result 217 states and 298 transitions. [2024-10-24 12:04:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:04:12,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2024-10-24 12:04:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:12,236 INFO L225 Difference]: With dead ends: 217 [2024-10-24 12:04:12,236 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 12:04:12,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:04:12,237 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 174 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:12,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 178 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 12:04:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2024-10-24 12:04:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-10-24 12:04:12,255 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 108 [2024-10-24 12:04:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:12,259 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-10-24 12:04:12,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-10-24 12:04:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 12:04:12,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:12,261 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:04:12,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -339322954, now seen corresponding path program 1 times [2024-10-24 12:04:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263699175] [2024-10-24 12:04:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:13,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:13,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263699175] [2024-10-24 12:04:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263699175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:13,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:13,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:04:13,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91075520] [2024-10-24 12:04:13,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:13,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:04:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:04:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:04:13,112 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:13,562 INFO L93 Difference]: Finished difference Result 246 states and 339 transitions. [2024-10-24 12:04:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:04:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2024-10-24 12:04:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:13,566 INFO L225 Difference]: With dead ends: 246 [2024-10-24 12:04:13,566 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 12:04:13,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:13,567 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 124 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:13,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 372 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 12:04:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 118. [2024-10-24 12:04:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 102 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 163 transitions. [2024-10-24 12:04:13,597 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 163 transitions. Word has length 108 [2024-10-24 12:04:13,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:13,602 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 163 transitions. [2024-10-24 12:04:13,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions. [2024-10-24 12:04:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 12:04:13,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:13,604 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:13,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 12:04:13,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:13,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:13,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1448125379, now seen corresponding path program 1 times [2024-10-24 12:04:13,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:13,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824942492] [2024-10-24 12:04:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824942492] [2024-10-24 12:04:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824942492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:14,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:04:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823675318] [2024-10-24 12:04:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:14,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:04:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:14,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:04:14,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:04:14,658 INFO L87 Difference]: Start difference. First operand 118 states and 163 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:15,348 INFO L93 Difference]: Finished difference Result 308 states and 419 transitions. [2024-10-24 12:04:15,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 12:04:15,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2024-10-24 12:04:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:15,351 INFO L225 Difference]: With dead ends: 308 [2024-10-24 12:04:15,352 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 12:04:15,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:04:15,353 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 207 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:15,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 347 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:04:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 12:04:15,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 118. [2024-10-24 12:04:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2024-10-24 12:04:15,371 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 109 [2024-10-24 12:04:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:15,371 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2024-10-24 12:04:15,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2024-10-24 12:04:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:04:15,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:15,374 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:15,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:04:15,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:15,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2125765336, now seen corresponding path program 1 times [2024-10-24 12:04:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607603693] [2024-10-24 12:04:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:15,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:17,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:17,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607603693] [2024-10-24 12:04:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607603693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:17,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 12:04:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358686324] [2024-10-24 12:04:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 12:04:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 12:04:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:04:17,455 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:18,781 INFO L93 Difference]: Finished difference Result 275 states and 373 transitions. [2024-10-24 12:04:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:04:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-24 12:04:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:18,783 INFO L225 Difference]: With dead ends: 275 [2024-10-24 12:04:18,783 INFO L226 Difference]: Without dead ends: 158 [2024-10-24 12:04:18,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-10-24 12:04:18,785 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 134 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:18,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 487 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 12:04:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-24 12:04:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 114. [2024-10-24 12:04:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 98 states have internal predecessors, (128), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2024-10-24 12:04:18,802 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 110 [2024-10-24 12:04:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:18,802 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2024-10-24 12:04:18,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2024-10-24 12:04:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:04:18,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:18,804 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:18,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:04:18,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:18,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:18,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1153417121, now seen corresponding path program 1 times [2024-10-24 12:04:18,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:18,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120472462] [2024-10-24 12:04:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120472462] [2024-10-24 12:04:19,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120472462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:19,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:19,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:04:19,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873572759] [2024-10-24 12:04:19,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:19,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:04:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:19,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:04:19,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:04:19,346 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:19,659 INFO L93 Difference]: Finished difference Result 247 states and 336 transitions. [2024-10-24 12:04:19,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:04:19,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-24 12:04:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:19,662 INFO L225 Difference]: With dead ends: 247 [2024-10-24 12:04:19,663 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 12:04:19,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:04:19,664 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 173 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:19,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 200 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 12:04:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2024-10-24 12:04:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-10-24 12:04:19,682 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 110 [2024-10-24 12:04:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-10-24 12:04:19,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-10-24 12:04:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:04:19,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:19,686 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:19,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:04:19,686 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1245930026, now seen corresponding path program 1 times [2024-10-24 12:04:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875521610] [2024-10-24 12:04:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:21,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875521610] [2024-10-24 12:04:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875521610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:21,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:21,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:04:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646713484] [2024-10-24 12:04:21,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:21,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:04:21,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:04:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:04:21,257 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:21,728 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2024-10-24 12:04:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:04:21,728 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-24 12:04:21,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:21,729 INFO L225 Difference]: With dead ends: 158 [2024-10-24 12:04:21,730 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 12:04:21,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:04:21,730 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 230 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:21,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 257 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:04:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 12:04:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-10-24 12:04:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.296875) internal successors, (166), 128 states have internal predecessors, (166), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 194 transitions. [2024-10-24 12:04:21,752 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 194 transitions. Word has length 110 [2024-10-24 12:04:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:21,753 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 194 transitions. [2024-10-24 12:04:21,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 194 transitions. [2024-10-24 12:04:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:04:21,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:21,755 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:21,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:04:21,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:21,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1245989608, now seen corresponding path program 1 times [2024-10-24 12:04:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:21,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013003013] [2024-10-24 12:04:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:21,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013003013] [2024-10-24 12:04:23,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013003013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:23,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:23,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:04:23,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036238623] [2024-10-24 12:04:23,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:23,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:04:23,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:23,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:04:23,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:04:23,545 INFO L87 Difference]: Start difference. First operand 144 states and 194 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:24,329 INFO L93 Difference]: Finished difference Result 299 states and 399 transitions. [2024-10-24 12:04:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:04:24,330 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-24 12:04:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:24,331 INFO L225 Difference]: With dead ends: 299 [2024-10-24 12:04:24,332 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 12:04:24,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-10-24 12:04:24,333 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 310 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:24,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 267 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:04:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 12:04:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-10-24 12:04:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:24,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 193 transitions. [2024-10-24 12:04:24,354 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 193 transitions. Word has length 110 [2024-10-24 12:04:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:24,354 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 193 transitions. [2024-10-24 12:04:24,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 193 transitions. [2024-10-24 12:04:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:04:24,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:24,356 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:24,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:04:24,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:24,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1303247910, now seen corresponding path program 1 times [2024-10-24 12:04:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:24,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823096221] [2024-10-24 12:04:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:25,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823096221] [2024-10-24 12:04:25,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823096221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:25,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:25,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:04:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554515573] [2024-10-24 12:04:25,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:25,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:04:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:04:25,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:04:25,818 INFO L87 Difference]: Start difference. First operand 144 states and 193 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:26,238 INFO L93 Difference]: Finished difference Result 299 states and 397 transitions. [2024-10-24 12:04:26,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:04:26,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-24 12:04:26,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:26,240 INFO L225 Difference]: With dead ends: 299 [2024-10-24 12:04:26,241 INFO L226 Difference]: Without dead ends: 156 [2024-10-24 12:04:26,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:26,242 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 271 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:26,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 213 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-24 12:04:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-10-24 12:04:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.28125) internal successors, (164), 128 states have internal predecessors, (164), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 192 transitions. [2024-10-24 12:04:26,268 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 192 transitions. Word has length 110 [2024-10-24 12:04:26,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:26,268 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 192 transitions. [2024-10-24 12:04:26,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:26,269 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 192 transitions. [2024-10-24 12:04:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 12:04:26,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:26,270 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:26,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:04:26,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:26,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 493901284, now seen corresponding path program 1 times [2024-10-24 12:04:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592577940] [2024-10-24 12:04:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:26,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592577940] [2024-10-24 12:04:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592577940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:26,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:04:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405058862] [2024-10-24 12:04:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:26,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:04:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:04:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:04:26,672 INFO L87 Difference]: Start difference. First operand 144 states and 192 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:27,002 INFO L93 Difference]: Finished difference Result 375 states and 491 transitions. [2024-10-24 12:04:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:04:27,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-24 12:04:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:27,005 INFO L225 Difference]: With dead ends: 375 [2024-10-24 12:04:27,005 INFO L226 Difference]: Without dead ends: 232 [2024-10-24 12:04:27,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:04:27,006 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 156 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:27,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 289 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:04:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-24 12:04:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2024-10-24 12:04:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 184 states have (on average 1.2608695652173914) internal successors, (232), 184 states have internal predecessors, (232), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 260 transitions. [2024-10-24 12:04:27,032 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 260 transitions. Word has length 110 [2024-10-24 12:04:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:27,033 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 260 transitions. [2024-10-24 12:04:27,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 12:04:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 260 transitions. [2024-10-24 12:04:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 12:04:27,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:27,035 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:27,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 12:04:27,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:27,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1357294582, now seen corresponding path program 1 times [2024-10-24 12:04:27,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:27,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140821007] [2024-10-24 12:04:27,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-24 12:04:28,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140821007] [2024-10-24 12:04:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140821007] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:04:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727616466] [2024-10-24 12:04:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:28,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:04:28,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:28,114 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-10-24 12:04:28,115 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-10-24 12:04:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:28,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 12:04:28,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:04:30,320 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-10-24 12:04:30,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:04:30,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 362 [2024-10-24 12:04:30,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 23 [2024-10-24 12:04:30,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 25 treesize of output 23 [2024-10-24 12:04:30,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2024-10-24 12:04:31,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:31,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:31,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 25 [2024-10-24 12:04:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 1 proven. 99 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 12:04:31,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:04:31,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_9_Pointer~0.offset Int) (~WrapperStruct00_var_1_8_Pointer~0.offset Int) (~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_389 (Array Int Int))) (< 0 (mod (select (select (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_12_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) ~WrapperStruct00_var_1_8_Pointer~0.offset))))) (store (store .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_389) c_~WrapperStruct00_var_1_15_Pointer~0.base (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select (select .cse0 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset))))) (store (select .cse1 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset (select (select .cse1 ~WrapperStruct00_var_1_9_Pointer~0.base) ~WrapperStruct00_var_1_9_Pointer~0.offset))))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) is different from false [2024-10-24 12:04:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727616466] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:04:31,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:04:31,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-10-24 12:04:31,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997198377] [2024-10-24 12:04:31,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:04:31,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 12:04:31,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 12:04:31,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2024-10-24 12:04:31,103 INFO L87 Difference]: Start difference. First operand 200 states and 260 transitions. Second operand has 15 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-24 12:04:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:32,363 INFO L93 Difference]: Finished difference Result 332 states and 431 transitions. [2024-10-24 12:04:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:04:32,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) Word has length 111 [2024-10-24 12:04:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:32,365 INFO L225 Difference]: With dead ends: 332 [2024-10-24 12:04:32,365 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 12:04:32,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=430, Unknown=1, NotChecked=44, Total=600 [2024-10-24 12:04:32,366 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 137 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:32,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 352 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 12:04:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 12:04:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-10-24 12:04:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.236842105263158) internal successors, (141), 114 states have internal predecessors, (141), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 169 transitions. [2024-10-24 12:04:32,408 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 169 transitions. Word has length 111 [2024-10-24 12:04:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:32,408 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 169 transitions. [2024-10-24 12:04:32,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (28), 4 states have call predecessors, (28), 5 states have return successors, (28), 5 states have call predecessors, (28), 6 states have call successors, (28) [2024-10-24 12:04:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 169 transitions. [2024-10-24 12:04:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 12:04:32,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:32,410 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:32,435 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-10-24 12:04:32,614 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,SelfDestructingSolverStorable14 [2024-10-24 12:04:32,615 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:32,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash -185366159, now seen corresponding path program 1 times [2024-10-24 12:04:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:32,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710466728] [2024-10-24 12:04:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:33,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710466728] [2024-10-24 12:04:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710466728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:33,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:33,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:04:33,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818481928] [2024-10-24 12:04:33,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:33,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:04:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:04:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:04:33,332 INFO L87 Difference]: Start difference. First operand 131 states and 169 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:33,685 INFO L93 Difference]: Finished difference Result 261 states and 337 transitions. [2024-10-24 12:04:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:04:33,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2024-10-24 12:04:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:33,687 INFO L225 Difference]: With dead ends: 261 [2024-10-24 12:04:33,687 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 12:04:33,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:04:33,688 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 68 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:33,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 123 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 12:04:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-24 12:04:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 114 states have internal predecessors, (137), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2024-10-24 12:04:33,715 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 112 [2024-10-24 12:04:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:33,716 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2024-10-24 12:04:33,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2024-10-24 12:04:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:04:33,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:33,718 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:33,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 12:04:33,718 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:33,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:33,719 INFO L85 PathProgramCache]: Analyzing trace with hash 541882744, now seen corresponding path program 1 times [2024-10-24 12:04:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:33,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234211942] [2024-10-24 12:04:33,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:33,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234211942] [2024-10-24 12:04:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234211942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:35,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:04:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343570787] [2024-10-24 12:04:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:35,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:04:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:04:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:04:35,565 INFO L87 Difference]: Start difference. First operand 131 states and 165 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:35,920 INFO L93 Difference]: Finished difference Result 136 states and 170 transitions. [2024-10-24 12:04:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:04:35,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-24 12:04:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:35,925 INFO L225 Difference]: With dead ends: 136 [2024-10-24 12:04:35,925 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 12:04:35,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:04:35,926 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 106 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:35,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 185 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:04:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 12:04:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-10-24 12:04:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.1982758620689655) internal successors, (139), 116 states have internal predecessors, (139), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 167 transitions. [2024-10-24 12:04:35,952 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 167 transitions. Word has length 114 [2024-10-24 12:04:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:35,955 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 167 transitions. [2024-10-24 12:04:35,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 167 transitions. [2024-10-24 12:04:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:04:35,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:35,956 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:35,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 12:04:35,957 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:35,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:35,957 INFO L85 PathProgramCache]: Analyzing trace with hash 541942326, now seen corresponding path program 1 times [2024-10-24 12:04:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:35,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051363873] [2024-10-24 12:04:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:38,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:38,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051363873] [2024-10-24 12:04:38,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051363873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:38,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:38,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:04:38,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950392230] [2024-10-24 12:04:38,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:38,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:04:38,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:38,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:04:38,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:04:38,092 INFO L87 Difference]: Start difference. First operand 133 states and 167 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:38,697 INFO L93 Difference]: Finished difference Result 266 states and 334 transitions. [2024-10-24 12:04:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:04:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-24 12:04:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:38,703 INFO L225 Difference]: With dead ends: 266 [2024-10-24 12:04:38,703 INFO L226 Difference]: Without dead ends: 134 [2024-10-24 12:04:38,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:04:38,704 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 169 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:38,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 223 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-24 12:04:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-10-24 12:04:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.1896551724137931) internal successors, (138), 116 states have internal predecessors, (138), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 166 transitions. [2024-10-24 12:04:38,739 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 166 transitions. Word has length 114 [2024-10-24 12:04:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:38,739 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 166 transitions. [2024-10-24 12:04:38,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 166 transitions. [2024-10-24 12:04:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 12:04:38,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:38,742 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:38,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 12:04:38,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:38,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:38,743 INFO L85 PathProgramCache]: Analyzing trace with hash 599200628, now seen corresponding path program 1 times [2024-10-24 12:04:38,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:38,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980352531] [2024-10-24 12:04:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:38,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 12:04:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 12:04:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:04:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 12:04:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:04:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 12:04:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:04:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:04:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:04:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:04:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:04:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:04:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:04:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:04:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 12:04:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:04:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980352531] [2024-10-24 12:04:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980352531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:04:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:04:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 12:04:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719051744] [2024-10-24 12:04:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:04:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:04:40,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:04:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:04:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:04:40,439 INFO L87 Difference]: Start difference. First operand 133 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:04:40,921 INFO L93 Difference]: Finished difference Result 265 states and 331 transitions. [2024-10-24 12:04:40,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:04:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-24 12:04:40,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:04:40,923 INFO L225 Difference]: With dead ends: 265 [2024-10-24 12:04:40,923 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 12:04:40,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:04:40,924 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 181 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:04:40,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 188 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:04:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 12:04:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 12:04:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 116 states have internal predecessors, (137), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 12:04:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2024-10-24 12:04:40,958 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 114 [2024-10-24 12:04:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:04:40,958 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2024-10-24 12:04:40,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 12:04:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2024-10-24 12:04:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 12:04:40,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:04:40,960 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:04:40,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 12:04:40,961 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:04:40,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:04:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 683853738, now seen corresponding path program 1 times [2024-10-24 12:04:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:04:40,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727569323] [2024-10-24 12:04:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:04:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 12:04:41,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805760354] [2024-10-24 12:04:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:04:41,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:04:41,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:04:41,082 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:04:41,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:04:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:04:41,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-24 12:04:41,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:04:42,247 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-10-24 12:04:42,953 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-10-24 12:04:43,629 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-10-24 12:04:44,300 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-10-24 12:04:44,881 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-10-24 12:04:45,551 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-10-24 12:04:46,938 INFO L349 Elim1Store]: treesize reduction 1201, result has 27.1 percent of original size [2024-10-24 12:04:46,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 358 treesize of output 711 [2024-10-24 12:04:53,981 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-24 12:04:53,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2024-10-24 12:04:54,049 INFO L349 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2024-10-24 12:04:54,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2024-10-24 12:04:54,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,110 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-10-24 12:04:54,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 26 [2024-10-24 12:04:54,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 12:04:54,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2024-10-24 12:04:54,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:54,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:54,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:54,708 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:04:54,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:54,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:54,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:54,816 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:04:54,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:54,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:54,981 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-10-24 12:04:54,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-10-24 12:04:55,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:55,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:55,030 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-10-24 12:04:55,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 45 [2024-10-24 12:04:55,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:55,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:55,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 12:04:55,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2024-10-24 12:04:55,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:55,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:55,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:55,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:55,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:58,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,748 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2024-10-24 12:04:58,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 61 [2024-10-24 12:04:58,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,834 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-10-24 12:04:58,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 26 [2024-10-24 12:04:58,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,867 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:04:58,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:58,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:58,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:58,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-24 12:04:59,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:59,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,130 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:04:59,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:59,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,183 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:04:59,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:59,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:59,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:04:59,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:04:59,351 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:04:59,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-10-24 12:05:00,641 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:00,719 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:00,730 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:00,815 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:00,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:00,854 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-10-24 12:05:00,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 22 [2024-10-24 12:05:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:00,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:00,876 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-24 12:05:00,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-24 12:05:00,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:00,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:00,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2024-10-24 12:05:01,132 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:01,139 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:01,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:01,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:01,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:01,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:01,300 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-10-24 12:05:01,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2024-10-24 12:05:01,312 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:01,318 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:01,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:01,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:01,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:01,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:05:07,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:05:07,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,275 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-10-24 12:05:07,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2024-10-24 12:05:07,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,340 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:05:07,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-10-24 12:05:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:05:07,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,396 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-10-24 12:05:07,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2024-10-24 12:05:07,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,429 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-24 12:05:07,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-24 12:05:07,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,523 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:05:07,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-10-24 12:05:07,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2024-10-24 12:05:07,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,565 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:05:07,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-10-24 12:05:07,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:07,588 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-24 12:05:07,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-10-24 12:05:08,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:08,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:08,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 12:05:08,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2024-10-24 12:05:08,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:08,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:08,523 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 12:05:08,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2024-10-24 12:05:09,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:09,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:09,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:05:09,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-10-24 12:05:09,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:09,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:09,818 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-10-24 12:05:09,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 32 [2024-10-24 12:05:09,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:09,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:09,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:05:09,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-10-24 12:05:10,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:10,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:10,212 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-10-24 12:05:10,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 32 [2024-10-24 12:05:10,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:10,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:10,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:05:10,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-10-24 12:05:10,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:10,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:05:10,550 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2024-10-24 12:05:10,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 32 [2024-10-24 12:05:10,615 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:10,758 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:10,985 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-24 12:05:11,113 WARN L214 Elim1Store]: Array PQE input equivalent to false