./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.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 730b0997679b06e2176dc62362c6855c3d3cc0770153581e48e0f33bef8d293d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:14:57,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:14:57,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:14:57,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:14:57,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:14:57,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:14:57,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:14:57,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:14:57,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:14:57,881 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:14:57,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:14:57,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:14:57,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:14:57,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:14:57,884 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:14:57,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:14:57,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:14:57,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:14:57,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:14:57,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:14:57,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:14:57,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:14:57,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:14:57,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:14:57,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:14:57,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:14:57,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:14:57,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:14:57,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:14:57,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:14:57,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:14:57,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:14:57,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:14:57,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:14:57,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:14:57,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:14:57,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:14:57,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:14:57,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:14:57,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:14:57,894 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:14:57,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:14:57,895 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 -> 730b0997679b06e2176dc62362c6855c3d3cc0770153581e48e0f33bef8d293d [2024-11-09 02:14:58,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:14:58,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:14:58,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:14:58,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:14:58,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:14:58,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i [2024-11-09 02:14:59,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:15:00,009 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:15:00,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i [2024-11-09 02:15:00,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb069f914/12db19743a3e4835ad8a767f6d313bb6/FLAG37f60f4d5 [2024-11-09 02:15:00,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb069f914/12db19743a3e4835ad8a767f6d313bb6 [2024-11-09 02:15:00,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:15:00,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:15:00,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:00,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:15:00,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:15:00,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:00,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a95043d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00, skipping insertion in model container [2024-11-09 02:15:00,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:00,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:15:00,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i[917,930] [2024-11-09 02:15:00,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:00,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:15:00,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-58.i[917,930] [2024-11-09 02:15:00,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:00,880 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:15:00,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00 WrapperNode [2024-11-09 02:15:00,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:00,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:00,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:15:00,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:15:00,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:00,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,006 INFO L138 Inliner]: procedures = 27, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2024-11-09 02:15:01,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:01,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:15:01,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:15:01,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:15:01,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,040 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-09 02:15:01,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:15:01,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:15:01,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:15:01,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:15:01,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (1/1) ... [2024-11-09 02:15:01,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:01,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:15:01,108 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-09 02:15:01,111 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-09 02:15:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:15:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 02:15:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 02:15:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 02:15:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 02:15:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 02:15:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 02:15:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:15:01,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:15:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:15:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 02:15:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:15:01,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:15:01,264 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:15:01,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:15:01,621 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-09 02:15:01,622 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:15:01,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:15:01,632 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:15:01,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:01 BoogieIcfgContainer [2024-11-09 02:15:01,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:15:01,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:15:01,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:15:01,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:15:01,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:15:00" (1/3) ... [2024-11-09 02:15:01,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e832508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:01, skipping insertion in model container [2024-11-09 02:15:01,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:00" (2/3) ... [2024-11-09 02:15:01,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e832508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:01, skipping insertion in model container [2024-11-09 02:15:01,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:01" (3/3) ... [2024-11-09 02:15:01,641 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-58.i [2024-11-09 02:15:01,658 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:15:01,658 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:15:01,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:15:01,732 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;@243ba57f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:15:01,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:15:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 75 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:15:01,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:01,749 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:01,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:01,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash -773362153, now seen corresponding path program 1 times [2024-11-09 02:15:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:01,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430668021] [2024-11-09 02:15:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:02,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430668021] [2024-11-09 02:15:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430668021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:15:02,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869419582] [2024-11-09 02:15:02,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:02,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:15:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:15:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:15:02,402 INFO L87 Difference]: Start difference. First operand has 92 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 75 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:15:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:02,440 INFO L93 Difference]: Finished difference Result 173 states and 269 transitions. [2024-11-09 02:15:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:15:02,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-09 02:15:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:02,450 INFO L225 Difference]: With dead ends: 173 [2024-11-09 02:15:02,450 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 02:15:02,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-09 02:15:02,461 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:02,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 02:15:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 02:15:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-09 02:15:02,554 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 116 [2024-11-09 02:15:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:02,555 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-09 02:15:02,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:15:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-09 02:15:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:15:02,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:02,563 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:02,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:15:02,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:02,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1258197323, now seen corresponding path program 1 times [2024-11-09 02:15:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312385462] [2024-11-09 02:15:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312385462] [2024-11-09 02:15:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312385462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:03,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:03,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:03,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132046619] [2024-11-09 02:15:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:03,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:03,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:03,140 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:03,210 INFO L93 Difference]: Finished difference Result 168 states and 237 transitions. [2024-11-09 02:15:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:03,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-11-09 02:15:03,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:03,214 INFO L225 Difference]: With dead ends: 168 [2024-11-09 02:15:03,215 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 02:15:03,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:03,218 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:03,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:15:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 02:15:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-09 02:15:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2024-11-09 02:15:03,236 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 116 [2024-11-09 02:15:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:03,241 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-11-09 02:15:03,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-11-09 02:15:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:15:03,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:03,246 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:03,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:15:03,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:03,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1256350281, now seen corresponding path program 1 times [2024-11-09 02:15:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:03,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497939142] [2024-11-09 02:15:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:04,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497939142] [2024-11-09 02:15:04,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497939142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:04,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:04,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:15:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445926772] [2024-11-09 02:15:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:04,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:15:04,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:04,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:15:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:15:04,355 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:04,800 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2024-11-09 02:15:04,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:15:04,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-11-09 02:15:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:04,802 INFO L225 Difference]: With dead ends: 209 [2024-11-09 02:15:04,802 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 02:15:04,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:15:04,804 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 224 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:04,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 245 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:15:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 02:15:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2024-11-09 02:15:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 79 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-09 02:15:04,823 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 116 [2024-11-09 02:15:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:04,824 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-09 02:15:04,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-09 02:15:04,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:15:04,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:04,829 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:04,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:15:04,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:04,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:04,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1727925920, now seen corresponding path program 1 times [2024-11-09 02:15:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:04,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649248761] [2024-11-09 02:15:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:07,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:07,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649248761] [2024-11-09 02:15:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649248761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:07,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:07,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:15:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526036918] [2024-11-09 02:15:07,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:15:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:07,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:15:07,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:15:07,957 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:15:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:08,863 INFO L93 Difference]: Finished difference Result 232 states and 323 transitions. [2024-11-09 02:15:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:15:08,864 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2024-11-09 02:15:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:08,865 INFO L225 Difference]: With dead ends: 232 [2024-11-09 02:15:08,865 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 02:15:08,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:15:08,867 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 426 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:08,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 503 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:15:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 02:15:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 110. [2024-11-09 02:15:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 153 transitions. [2024-11-09 02:15:08,921 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 153 transitions. Word has length 116 [2024-11-09 02:15:08,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:08,922 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 153 transitions. [2024-11-09 02:15:08,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:15:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 153 transitions. [2024-11-09 02:15:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:15:08,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:08,924 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:08,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:15:08,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:08,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1469760482, now seen corresponding path program 1 times [2024-11-09 02:15:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071100686] [2024-11-09 02:15:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071100686] [2024-11-09 02:15:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071100686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:15:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199882245] [2024-11-09 02:15:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:12,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:15:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:15:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:15:12,852 INFO L87 Difference]: Start difference. First operand 110 states and 153 transitions. Second operand has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 02:15:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:14,202 INFO L93 Difference]: Finished difference Result 243 states and 337 transitions. [2024-11-09 02:15:14,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:15:14,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2024-11-09 02:15:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:14,205 INFO L225 Difference]: With dead ends: 243 [2024-11-09 02:15:14,205 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 02:15:14,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:15:14,207 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 277 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:14,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 375 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:15:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 02:15:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-11-09 02:15:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2024-11-09 02:15:14,229 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 116 [2024-11-09 02:15:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:14,230 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2024-11-09 02:15:14,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 02:15:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2024-11-09 02:15:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:15:14,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:14,232 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:14,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:15:14,232 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:14,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash 978693474, now seen corresponding path program 1 times [2024-11-09 02:15:14,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:14,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297426088] [2024-11-09 02:15:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297426088] [2024-11-09 02:15:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297426088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:15:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562244131] [2024-11-09 02:15:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:15:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:17,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:15:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:15:17,776 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 02:15:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:19,155 INFO L93 Difference]: Finished difference Result 247 states and 341 transitions. [2024-11-09 02:15:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:15:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2024-11-09 02:15:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:19,157 INFO L225 Difference]: With dead ends: 247 [2024-11-09 02:15:19,160 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 02:15:19,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:15:19,161 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 207 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:19,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 344 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 02:15:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 02:15:19,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 111. [2024-11-09 02:15:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2024-11-09 02:15:19,191 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 116 [2024-11-09 02:15:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:19,191 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2024-11-09 02:15:19,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.4) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 02:15:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2024-11-09 02:15:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:15:19,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:19,193 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:19,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:15:19,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:19,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1236858912, now seen corresponding path program 1 times [2024-11-09 02:15:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216963461] [2024-11-09 02:15:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:19,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:19,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216963461] [2024-11-09 02:15:19,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216963461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:19,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:19,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:15:19,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055276047] [2024-11-09 02:15:19,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:19,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:15:19,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:19,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:15:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:15:19,999 INFO L87 Difference]: Start difference. First operand 111 states and 153 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:20,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:20,547 INFO L93 Difference]: Finished difference Result 248 states and 341 transitions. [2024-11-09 02:15:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:15:20,553 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 116 [2024-11-09 02:15:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:20,555 INFO L225 Difference]: With dead ends: 248 [2024-11-09 02:15:20,556 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 02:15:20,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:15:20,558 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 166 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:20,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 853 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:15:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 02:15:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 111. [2024-11-09 02:15:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2024-11-09 02:15:20,602 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 116 [2024-11-09 02:15:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2024-11-09 02:15:20,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2024-11-09 02:15:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:15:20,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:20,604 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:20,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:15:20,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:20,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1225741899, now seen corresponding path program 1 times [2024-11-09 02:15:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061120338] [2024-11-09 02:15:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:22,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061120338] [2024-11-09 02:15:22,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061120338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:15:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190027069] [2024-11-09 02:15:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:22,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:15:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:15:22,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:15:22,155 INFO L87 Difference]: Start difference. First operand 111 states and 153 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:22,772 INFO L93 Difference]: Finished difference Result 268 states and 369 transitions. [2024-11-09 02:15:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 02:15:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-11-09 02:15:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:22,774 INFO L225 Difference]: With dead ends: 268 [2024-11-09 02:15:22,774 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 02:15:22,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:15:22,775 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 236 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:22,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 418 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:15:22,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 02:15:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124. [2024-11-09 02:15:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 107 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2024-11-09 02:15:22,792 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 117 [2024-11-09 02:15:22,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:22,793 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2024-11-09 02:15:22,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2024-11-09 02:15:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:15:22,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:22,795 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:22,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:15:22,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:22,796 INFO L85 PathProgramCache]: Analyzing trace with hash -967576461, now seen corresponding path program 1 times [2024-11-09 02:15:22,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:22,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572250961] [2024-11-09 02:15:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:24,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:24,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:24,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:24,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:25,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572250961] [2024-11-09 02:15:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572250961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:25,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:15:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434557960] [2024-11-09 02:15:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:15:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:25,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:15:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:15:25,062 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 02:15:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:25,704 INFO L93 Difference]: Finished difference Result 277 states and 383 transitions. [2024-11-09 02:15:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:15:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2024-11-09 02:15:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:25,706 INFO L225 Difference]: With dead ends: 277 [2024-11-09 02:15:25,706 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 02:15:25,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:15:25,707 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 212 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:25,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 270 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:15:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 02:15:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2024-11-09 02:15:25,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 107 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2024-11-09 02:15:25,719 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 117 [2024-11-09 02:15:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:25,719 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2024-11-09 02:15:25,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 02:15:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2024-11-09 02:15:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:15:25,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:25,720 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:25,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:15:25,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:25,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1697317538, now seen corresponding path program 1 times [2024-11-09 02:15:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617414430] [2024-11-09 02:15:25,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:25,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:26,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617414430] [2024-11-09 02:15:26,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617414430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:26,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 02:15:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420596422] [2024-11-09 02:15:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:26,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 02:15:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 02:15:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:15:26,103 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:26,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:26,563 INFO L93 Difference]: Finished difference Result 271 states and 372 transitions. [2024-11-09 02:15:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:15:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-11-09 02:15:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:26,565 INFO L225 Difference]: With dead ends: 271 [2024-11-09 02:15:26,565 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 02:15:26,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:15:26,566 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 172 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:26,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 292 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:15:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 02:15:26,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2024-11-09 02:15:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2024-11-09 02:15:26,583 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 117 [2024-11-09 02:15:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:26,583 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2024-11-09 02:15:26,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2024-11-09 02:15:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:15:26,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:26,585 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:26,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:15:26,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:26,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:26,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1075080691, now seen corresponding path program 1 times [2024-11-09 02:15:26,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285578481] [2024-11-09 02:15:26,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285578481] [2024-11-09 02:15:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285578481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:28,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:15:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912154118] [2024-11-09 02:15:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:28,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:15:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:15:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:15:28,713 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 02:15:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:29,352 INFO L93 Difference]: Finished difference Result 267 states and 363 transitions. [2024-11-09 02:15:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:15:29,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2024-11-09 02:15:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:29,354 INFO L225 Difference]: With dead ends: 267 [2024-11-09 02:15:29,357 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 02:15:29,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:15:29,358 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 280 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:29,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 276 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:15:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 02:15:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 122. [2024-11-09 02:15:29,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 105 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 165 transitions. [2024-11-09 02:15:29,395 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 165 transitions. Word has length 117 [2024-11-09 02:15:29,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:29,395 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 165 transitions. [2024-11-09 02:15:29,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 02:15:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2024-11-09 02:15:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 02:15:29,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:29,397 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:29,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:15:29,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:29,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1333246129, now seen corresponding path program 1 times [2024-11-09 02:15:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:29,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586247690] [2024-11-09 02:15:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:31,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586247690] [2024-11-09 02:15:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586247690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:31,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 02:15:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873274525] [2024-11-09 02:15:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 02:15:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 02:15:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:15:31,603 INFO L87 Difference]: Start difference. First operand 122 states and 165 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 02:15:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:32,929 INFO L93 Difference]: Finished difference Result 267 states and 361 transitions. [2024-11-09 02:15:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:15:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 117 [2024-11-09 02:15:32,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:32,932 INFO L225 Difference]: With dead ends: 267 [2024-11-09 02:15:32,932 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 02:15:32,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-09 02:15:32,933 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 200 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:32,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 819 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:15:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 02:15:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2024-11-09 02:15:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 102 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 161 transitions. [2024-11-09 02:15:32,961 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 161 transitions. Word has length 117 [2024-11-09 02:15:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:32,961 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 161 transitions. [2024-11-09 02:15:32,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 02:15:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 161 transitions. [2024-11-09 02:15:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:15:32,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:32,963 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:32,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:15:32,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:32,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1245925263, now seen corresponding path program 1 times [2024-11-09 02:15:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:32,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15882252] [2024-11-09 02:15:32,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:15:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:15:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:15:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:15:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:15:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15882252] [2024-11-09 02:15:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15882252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:15:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139954297] [2024-11-09 02:15:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:33,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:15:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:15:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:15:33,526 INFO L87 Difference]: Start difference. First operand 119 states and 161 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:34,145 INFO L93 Difference]: Finished difference Result 280 states and 373 transitions. [2024-11-09 02:15:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:15:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 118 [2024-11-09 02:15:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:34,147 INFO L225 Difference]: With dead ends: 280 [2024-11-09 02:15:34,147 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 02:15:34,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:15:34,150 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 149 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:15:34,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 711 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:15:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 02:15:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139. [2024-11-09 02:15:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 122 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:15:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 182 transitions. [2024-11-09 02:15:34,166 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 182 transitions. Word has length 118 [2024-11-09 02:15:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:34,167 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 182 transitions. [2024-11-09 02:15:34,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:15:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 182 transitions. [2024-11-09 02:15:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 02:15:34,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:34,169 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:15:34,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:15:34,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:34,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1144824846, now seen corresponding path program 1 times [2024-11-09 02:15:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677831069] [2024-11-09 02:15:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:16:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:16:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:16:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:16:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:16:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:16:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:16:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:16:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:18,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677831069] [2024-11-09 02:16:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677831069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 02:16:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388322764] [2024-11-09 02:16:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 02:16:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 02:16:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:16:18,506 INFO L87 Difference]: Start difference. First operand 139 states and 182 transitions. Second operand has 18 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 18 states have internal predecessors, (47), 6 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 6 states have call successors, (15)