./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.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 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:54:12,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:54:12,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:54:12,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:54:12,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:54:12,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:54:12,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:54:12,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:54:12,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:54:12,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:54:12,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:54:12,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:54:12,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:54:12,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:54:12,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:54:12,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:54:12,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:54:12,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:54:12,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:54:12,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:54:12,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:54:12,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:54:12,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:54:12,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:54:12,848 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:54:12,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:54:12,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:54:12,849 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:54:12,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:54:12,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:54:12,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:54:12,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:54:12,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:54:12,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:54:12,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:54:12,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:54:12,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:54:12,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:54:12,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:54:12,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:54:12,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:54:12,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:54:12,853 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 -> 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 [2024-11-16 14:54:13,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:54:13,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:54:13,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:54:13,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:54:13,132 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:54:13,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2024-11-16 14:54:14,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:54:14,789 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:54:14,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2024-11-16 14:54:14,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6364f29dd/ed8a1a77cc114ef0829ce2a7ab9220c7/FLAG49e999d4e [2024-11-16 14:54:14,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6364f29dd/ed8a1a77cc114ef0829ce2a7ab9220c7 [2024-11-16 14:54:14,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:54:14,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:54:14,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:54:14,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:54:14,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:54:14,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:54:14" (1/1) ... [2024-11-16 14:54:14,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe82898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:14, skipping insertion in model container [2024-11-16 14:54:14,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:54:14" (1/1) ... [2024-11-16 14:54:14,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:54:15,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i[919,932] [2024-11-16 14:54:15,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:54:15,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:54:15,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i[919,932] [2024-11-16 14:54:15,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:54:15,236 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:54:15,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15 WrapperNode [2024-11-16 14:54:15,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:54:15,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:54:15,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:54:15,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:54:15,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,294 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 228 [2024-11-16 14:54:15,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:54:15,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:54:15,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:54:15,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:54:15,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:54:15,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:54:15,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:54:15,370 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:54:15,371 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:54:15,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (1/1) ... [2024-11-16 14:54:15,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:54:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:54:15,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:54:15,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:54:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:54:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:54:15,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:54:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:54:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:54:15,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:54:15,564 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:54:15,566 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:54:15,976 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1; [2024-11-16 14:54:16,020 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-16 14:54:16,021 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:54:16,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:54:16,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:54:16,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:54:16 BoogieIcfgContainer [2024-11-16 14:54:16,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:54:16,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:54:16,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:54:16,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:54:16,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:54:14" (1/3) ... [2024-11-16 14:54:16,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff8fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:54:16, skipping insertion in model container [2024-11-16 14:54:16,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:54:15" (2/3) ... [2024-11-16 14:54:16,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bff8fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:54:16, skipping insertion in model container [2024-11-16 14:54:16,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:54:16" (3/3) ... [2024-11-16 14:54:16,062 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2024-11-16 14:54:16,081 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:54:16,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:54:16,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:54:16,163 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;@437ea31c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:54:16,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:54:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:54:16,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 14:54:16,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:16,185 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:16,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:16,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1741744845, now seen corresponding path program 1 times [2024-11-16 14:54:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:16,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663022915] [2024-11-16 14:54:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663022915] [2024-11-16 14:54:16,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663022915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:16,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:54:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423837325] [2024-11-16 14:54:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:54:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:16,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:54:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:54:16,728 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:54:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:16,777 INFO L93 Difference]: Finished difference Result 184 states and 311 transitions. [2024-11-16 14:54:16,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:54:16,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2024-11-16 14:54:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:16,789 INFO L225 Difference]: With dead ends: 184 [2024-11-16 14:54:16,790 INFO L226 Difference]: Without dead ends: 91 [2024-11-16 14:54:16,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:54:16,796 INFO L432 NwaCegarLoop]: 137 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, 137 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-11-16 14:54:16,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:54:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-16 14:54:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-16 14:54:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.463768115942029) internal successors, (101), 69 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 14:54:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 141 transitions. [2024-11-16 14:54:16,839 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 141 transitions. Word has length 143 [2024-11-16 14:54:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:16,840 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 141 transitions. [2024-11-16 14:54:16,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:54:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 141 transitions. [2024-11-16 14:54:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 14:54:16,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:16,847 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:16,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:54:16,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:16,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1458068331, now seen corresponding path program 1 times [2024-11-16 14:54:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000557618] [2024-11-16 14:54:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:17,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:17,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000557618] [2024-11-16 14:54:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000557618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:17,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:17,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:54:17,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258931924] [2024-11-16 14:54:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:17,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:54:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:17,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:54:17,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:54:17,620 INFO L87 Difference]: Start difference. First operand 91 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:17,866 INFO L93 Difference]: Finished difference Result 299 states and 464 transitions. [2024-11-16 14:54:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:54:17,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-16 14:54:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:17,873 INFO L225 Difference]: With dead ends: 299 [2024-11-16 14:54:17,874 INFO L226 Difference]: Without dead ends: 211 [2024-11-16 14:54:17,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:54:17,877 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 169 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:54:17,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 428 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:54:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-16 14:54:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 178. [2024-11-16 14:54:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 135 states have internal predecessors, (198), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 14:54:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 278 transitions. [2024-11-16 14:54:17,926 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 278 transitions. Word has length 143 [2024-11-16 14:54:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:17,927 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 278 transitions. [2024-11-16 14:54:17,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 278 transitions. [2024-11-16 14:54:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 14:54:17,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:17,935 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:17,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:54:17,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:17,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1963951043, now seen corresponding path program 1 times [2024-11-16 14:54:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13003218] [2024-11-16 14:54:17,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:18,348 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:18,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:18,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13003218] [2024-11-16 14:54:18,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13003218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:18,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:18,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:54:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038857844] [2024-11-16 14:54:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:18,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:54:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:18,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:54:18,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:54:18,351 INFO L87 Difference]: Start difference. First operand 178 states and 278 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:18,638 INFO L93 Difference]: Finished difference Result 524 states and 818 transitions. [2024-11-16 14:54:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:54:18,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-16 14:54:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:18,643 INFO L225 Difference]: With dead ends: 524 [2024-11-16 14:54:18,643 INFO L226 Difference]: Without dead ends: 349 [2024-11-16 14:54:18,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:54:18,646 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 181 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:54:18,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 532 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:54:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-16 14:54:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 182. [2024-11-16 14:54:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 139 states have (on average 1.4532374100719425) internal successors, (202), 139 states have internal predecessors, (202), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 14:54:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 282 transitions. [2024-11-16 14:54:18,695 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 282 transitions. Word has length 144 [2024-11-16 14:54:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:18,696 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 282 transitions. [2024-11-16 14:54:18,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 282 transitions. [2024-11-16 14:54:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:54:18,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:18,702 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:18,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:54:18,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:18,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1615853074, now seen corresponding path program 1 times [2024-11-16 14:54:18,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:18,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336376228] [2024-11-16 14:54:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:21,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:21,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336376228] [2024-11-16 14:54:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336376228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:21,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:54:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791046695] [2024-11-16 14:54:21,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:21,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:54:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:54:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:54:21,140 INFO L87 Difference]: Start difference. First operand 182 states and 282 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:21,622 INFO L93 Difference]: Finished difference Result 551 states and 843 transitions. [2024-11-16 14:54:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 14:54:21,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 14:54:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:21,626 INFO L225 Difference]: With dead ends: 551 [2024-11-16 14:54:21,628 INFO L226 Difference]: Without dead ends: 372 [2024-11-16 14:54:21,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 14:54:21,634 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 224 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:54:21,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 465 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:54:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-16 14:54:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 252. [2024-11-16 14:54:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 188 states have (on average 1.446808510638298) internal successors, (272), 188 states have internal predecessors, (272), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 14:54:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 392 transitions. [2024-11-16 14:54:21,677 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 392 transitions. Word has length 145 [2024-11-16 14:54:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:21,677 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 392 transitions. [2024-11-16 14:54:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 392 transitions. [2024-11-16 14:54:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:54:21,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:21,680 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:21,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:54:21,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:21,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1886938995, now seen corresponding path program 1 times [2024-11-16 14:54:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:21,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562161573] [2024-11-16 14:54:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:44,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:44,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562161573] [2024-11-16 14:54:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562161573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:44,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:44,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 14:54:44,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216010699] [2024-11-16 14:54:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:44,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 14:54:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 14:54:44,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-16 14:54:44,085 INFO L87 Difference]: Start difference. First operand 252 states and 392 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:46,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:46,859 INFO L93 Difference]: Finished difference Result 697 states and 1039 transitions. [2024-11-16 14:54:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 14:54:46,859 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 14:54:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:46,866 INFO L225 Difference]: With dead ends: 697 [2024-11-16 14:54:46,867 INFO L226 Difference]: Without dead ends: 518 [2024-11-16 14:54:46,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-16 14:54:46,870 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 489 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 14:54:46,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 907 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 14:54:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-16 14:54:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 343. [2024-11-16 14:54:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 267 states have (on average 1.4232209737827715) internal successors, (380), 269 states have internal predecessors, (380), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:54:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 520 transitions. [2024-11-16 14:54:46,908 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 520 transitions. Word has length 145 [2024-11-16 14:54:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:46,908 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 520 transitions. [2024-11-16 14:54:46,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 520 transitions. [2024-11-16 14:54:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:54:46,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:46,910 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:46,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:54:46,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:46,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash -665217966, now seen corresponding path program 1 times [2024-11-16 14:54:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440202760] [2024-11-16 14:54:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:49,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440202760] [2024-11-16 14:54:49,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440202760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:49,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:49,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 14:54:49,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112073084] [2024-11-16 14:54:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:49,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 14:54:49,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:49,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 14:54:49,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 14:54:49,126 INFO L87 Difference]: Start difference. First operand 343 states and 520 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:50,618 INFO L93 Difference]: Finished difference Result 955 states and 1412 transitions. [2024-11-16 14:54:50,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 14:54:50,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 14:54:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:50,627 INFO L225 Difference]: With dead ends: 955 [2024-11-16 14:54:50,628 INFO L226 Difference]: Without dead ends: 689 [2024-11-16 14:54:50,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:54:50,631 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 408 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:54:50,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 555 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 14:54:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-11-16 14:54:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 394. [2024-11-16 14:54:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 318 states have (on average 1.4182389937106918) internal successors, (451), 320 states have internal predecessors, (451), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:54:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 591 transitions. [2024-11-16 14:54:50,672 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 591 transitions. Word has length 145 [2024-11-16 14:54:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:50,672 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 591 transitions. [2024-11-16 14:54:50,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 591 transitions. [2024-11-16 14:54:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:54:50,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:50,674 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:50,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 14:54:50,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1690425490, now seen corresponding path program 1 times [2024-11-16 14:54:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:50,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63049931] [2024-11-16 14:54:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:52,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63049931] [2024-11-16 14:54:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63049931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:52,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 14:54:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751963114] [2024-11-16 14:54:52,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:52,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 14:54:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:52,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 14:54:52,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 14:54:52,928 INFO L87 Difference]: Start difference. First operand 394 states and 591 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:54,276 INFO L93 Difference]: Finished difference Result 1019 states and 1489 transitions. [2024-11-16 14:54:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:54:54,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 14:54:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:54,282 INFO L225 Difference]: With dead ends: 1019 [2024-11-16 14:54:54,282 INFO L226 Difference]: Without dead ends: 704 [2024-11-16 14:54:54,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-16 14:54:54,285 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 332 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 14:54:54,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 592 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 14:54:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2024-11-16 14:54:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 553. [2024-11-16 14:54:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 477 states have (on average 1.421383647798742) internal successors, (678), 479 states have internal predecessors, (678), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:54:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 818 transitions. [2024-11-16 14:54:54,329 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 818 transitions. Word has length 145 [2024-11-16 14:54:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:54,330 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 818 transitions. [2024-11-16 14:54:54,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 818 transitions. [2024-11-16 14:54:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:54:54,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:54,333 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 14:54:54,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash -108301265, now seen corresponding path program 1 times [2024-11-16 14:54:54,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884657552] [2024-11-16 14:54:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:54:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:54:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:54:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:54:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:54:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:54:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:54:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:54:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:54:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:54:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:54:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:54:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:54:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:54:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:54:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:54:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:54:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:54:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:54:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:54:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:54:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:54:54,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:54:54,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884657552] [2024-11-16 14:54:54,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884657552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:54:54,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:54:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:54:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314665191] [2024-11-16 14:54:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:54:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:54:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:54:54,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:54:54,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:54:54,786 INFO L87 Difference]: Start difference. First operand 553 states and 818 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:55,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:54:55,037 INFO L93 Difference]: Finished difference Result 924 states and 1367 transitions. [2024-11-16 14:54:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:54:55,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 14:54:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:54:55,044 INFO L225 Difference]: With dead ends: 924 [2024-11-16 14:54:55,044 INFO L226 Difference]: Without dead ends: 562 [2024-11-16 14:54:55,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:54:55,046 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 120 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:54:55,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 340 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:54:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-16 14:54:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 503. [2024-11-16 14:54:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 427 states have (on average 1.3887587822014051) internal successors, (593), 429 states have internal predecessors, (593), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:54:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 733 transitions. [2024-11-16 14:54:55,093 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 733 transitions. Word has length 145 [2024-11-16 14:54:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:54:55,093 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 733 transitions. [2024-11-16 14:54:55,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:54:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 733 transitions. [2024-11-16 14:54:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 14:54:55,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:54:55,095 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:54:55,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 14:54:55,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:54:55,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:54:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1054718604, now seen corresponding path program 1 times [2024-11-16 14:54:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:54:55,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371824875] [2024-11-16 14:54:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:54:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:54:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:55:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:55:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:55:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:55:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:55:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:55:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:55:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:55:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:55:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:55:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:55:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:55:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:55:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:55:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:55:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:55:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:55:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:55:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:55:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:55:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:55:17,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:55:17,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371824875] [2024-11-16 14:55:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371824875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:55:17,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:55:17,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-16 14:55:17,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664645956] [2024-11-16 14:55:17,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:55:17,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 14:55:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:55:17,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 14:55:17,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-16 14:55:17,968 INFO L87 Difference]: Start difference. First operand 503 states and 733 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:55:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:55:20,189 INFO L93 Difference]: Finished difference Result 743 states and 1067 transitions. [2024-11-16 14:55:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 14:55:20,189 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2024-11-16 14:55:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:55:20,193 INFO L225 Difference]: With dead ends: 743 [2024-11-16 14:55:20,193 INFO L226 Difference]: Without dead ends: 607 [2024-11-16 14:55:20,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 14:55:20,194 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 423 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:55:20,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1234 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 14:55:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-16 14:55:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 508. [2024-11-16 14:55:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 432 states have (on average 1.3842592592592593) internal successors, (598), 434 states have internal predecessors, (598), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-16 14:55:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 738 transitions. [2024-11-16 14:55:20,241 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 738 transitions. Word has length 145 [2024-11-16 14:55:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:55:20,242 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 738 transitions. [2024-11-16 14:55:20,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 14:55:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 738 transitions. [2024-11-16 14:55:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 14:55:20,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:55:20,244 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:55:20,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 14:55:20,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:55:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:55:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1765602457, now seen corresponding path program 1 times [2024-11-16 14:55:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:55:20,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362310947] [2024-11-16 14:55:20,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:55:20,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:55:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:55:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:55:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:55:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:55:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:55:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:55:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:55:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:55:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 14:55:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:55:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 14:55:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 14:55:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 14:55:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 14:55:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 14:55:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:55:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:55:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:55:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:55:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:55:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:55:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 14:55:21,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:55:21,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362310947] [2024-11-16 14:55:21,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362310947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:55:21,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:55:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 14:55:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467771786] [2024-11-16 14:55:21,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:55:21,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 14:55:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:55:21,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 14:55:21,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-16 14:55:21,617 INFO L87 Difference]: Start difference. First operand 508 states and 738 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:55:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:55:22,266 INFO L93 Difference]: Finished difference Result 1102 states and 1598 transitions. [2024-11-16 14:55:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:55:22,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-16 14:55:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:55:22,272 INFO L225 Difference]: With dead ends: 1102 [2024-11-16 14:55:22,272 INFO L226 Difference]: Without dead ends: 836 [2024-11-16 14:55:22,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:55:22,273 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 197 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:55:22,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 922 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 14:55:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2024-11-16 14:55:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 502. [2024-11-16 14:55:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 431 states have (on average 1.396751740139211) internal successors, (602), 432 states have internal predecessors, (602), 65 states have call successors, (65), 5 states have call predecessors, (65), 5 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-16 14:55:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 732 transitions. [2024-11-16 14:55:22,316 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 732 transitions. Word has length 146 [2024-11-16 14:55:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:55:22,317 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 732 transitions. [2024-11-16 14:55:22,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 14:55:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 732 transitions. [2024-11-16 14:55:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 14:55:22,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:55:22,320 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:55:22,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 14:55:22,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:55:22,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:55:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1532292486, now seen corresponding path program 1 times [2024-11-16 14:55:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:55:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783708898] [2024-11-16 14:55:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:55:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:55:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat