./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:03:02,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:03:02,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:03:02,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:03:02,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:03:02,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:03:02,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:03:02,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:03:02,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:03:02,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:03:02,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:03:02,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:03:02,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:03:02,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:03:02,275 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:03:02,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:03:02,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:03:02,276 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:03:02,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:03:02,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:03:02,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:03:02,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:03:02,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:03:02,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:03:02,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:03:02,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:03:02,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:03:02,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:03:02,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:03:02,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:03:02,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:03:02,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:03:02,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:03:02,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:03:02,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:03:02,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:03:02,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:03:02,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:03:02,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:03:02,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:03:02,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:03:02,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:03:02,282 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 -> ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a [2024-11-16 12:03:02,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:03:02,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:03:02,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:03:02,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:03:02,529 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:03:02,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-11-16 12:03:03,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:03:03,982 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:03:03,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-11-16 12:03:03,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587f2e596/52e7caa90aa040b599351d532da52a8c/FLAG6eb37f7ed [2024-11-16 12:03:04,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587f2e596/52e7caa90aa040b599351d532da52a8c [2024-11-16 12:03:04,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:03:04,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:03:04,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:03:04,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:03:04,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:03:04,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2205dfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04, skipping insertion in model container [2024-11-16 12:03:04,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:03:04,181 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_codestructure_dependencies_file-34.i[919,932] [2024-11-16 12:03:04,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:03:04,237 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:03:04,247 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_codestructure_dependencies_file-34.i[919,932] [2024-11-16 12:03:04,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:03:04,282 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:03:04,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04 WrapperNode [2024-11-16 12:03:04,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:03:04,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:03:04,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:03:04,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:03:04,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,327 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-16 12:03:04,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:03:04,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:03:04,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:03:04,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:03:04,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,360 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:03:04,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:03:04,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:03:04,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:03:04,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:03:04,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (1/1) ... [2024-11-16 12:03:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:03:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:03:04,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:03:04,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:03:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:03:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:03:04,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:03:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:03:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:03:04,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:03:04,504 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:03:04,506 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:03:04,757 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2024-11-16 12:03:04,778 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 12:03:04,778 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:03:04,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:03:04,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:03:04,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:03:04 BoogieIcfgContainer [2024-11-16 12:03:04,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:03:04,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:03:04,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:03:04,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:03:04,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:03:04" (1/3) ... [2024-11-16 12:03:04,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e7d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:04, skipping insertion in model container [2024-11-16 12:03:04,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:04" (2/3) ... [2024-11-16 12:03:04,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e7d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:04, skipping insertion in model container [2024-11-16 12:03:04,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:03:04" (3/3) ... [2024-11-16 12:03:04,823 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-34.i [2024-11-16 12:03:04,838 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:03:04,839 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:03:04,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:03:04,929 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;@7107df32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:03:04,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:03:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 12:03:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 12:03:04,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:04,950 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:04,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:04,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -337468153, now seen corresponding path program 1 times [2024-11-16 12:03:04,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:04,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332583678] [2024-11-16 12:03:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:05,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:05,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332583678] [2024-11-16 12:03:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332583678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:03:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880656732] [2024-11-16 12:03:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:05,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:03:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:03:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:03:05,325 INFO L87 Difference]: Start difference. First operand has 72 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 12:03:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:05,355 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2024-11-16 12:03:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:03:05,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2024-11-16 12:03:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:05,367 INFO L225 Difference]: With dead ends: 136 [2024-11-16 12:03:05,368 INFO L226 Difference]: Without dead ends: 67 [2024-11-16 12:03:05,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:03:05,377 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:05,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:03:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-16 12:03:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-16 12:03:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 12:03:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-16 12:03:05,421 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2024-11-16 12:03:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:05,422 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-16 12:03:05,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 12:03:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-16 12:03:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 12:03:05,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:05,426 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:05,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:03:05,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash -824443994, now seen corresponding path program 1 times [2024-11-16 12:03:05,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:05,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260614314] [2024-11-16 12:03:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:05,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:05,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260614314] [2024-11-16 12:03:05,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260614314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:05,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:05,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:03:05,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466468799] [2024-11-16 12:03:05,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:05,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:03:05,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:05,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:03:05,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:03:05,868 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:06,023 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2024-11-16 12:03:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:03:06,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2024-11-16 12:03:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:06,026 INFO L225 Difference]: With dead ends: 225 [2024-11-16 12:03:06,026 INFO L226 Difference]: Without dead ends: 161 [2024-11-16 12:03:06,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:03:06,028 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 129 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:06,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 306 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:03:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-16 12:03:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 130. [2024-11-16 12:03:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:03:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 198 transitions. [2024-11-16 12:03:06,060 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 198 transitions. Word has length 94 [2024-11-16 12:03:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:06,062 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 198 transitions. [2024-11-16 12:03:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 198 transitions. [2024-11-16 12:03:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 12:03:06,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:06,064 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:03:06,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash 488708173, now seen corresponding path program 1 times [2024-11-16 12:03:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405051081] [2024-11-16 12:03:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:06,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405051081] [2024-11-16 12:03:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405051081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:06,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:06,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:03:06,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182715474] [2024-11-16 12:03:06,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:06,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:03:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:06,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:03:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:03:06,293 INFO L87 Difference]: Start difference. First operand 130 states and 198 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:06,474 INFO L93 Difference]: Finished difference Result 419 states and 632 transitions. [2024-11-16 12:03:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:03:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-11-16 12:03:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:06,477 INFO L225 Difference]: With dead ends: 419 [2024-11-16 12:03:06,477 INFO L226 Difference]: Without dead ends: 292 [2024-11-16 12:03:06,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:03:06,479 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 164 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:06,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 266 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:03:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-16 12:03:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 132. [2024-11-16 12:03:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:03:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 198 transitions. [2024-11-16 12:03:06,503 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 198 transitions. Word has length 95 [2024-11-16 12:03:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:06,505 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 198 transitions. [2024-11-16 12:03:06,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 198 transitions. [2024-11-16 12:03:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 12:03:06,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:06,507 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:06,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:03:06,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:06,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1878627178, now seen corresponding path program 1 times [2024-11-16 12:03:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:06,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354529775] [2024-11-16 12:03:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:06,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354529775] [2024-11-16 12:03:06,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354529775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:06,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:06,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:03:06,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205434160] [2024-11-16 12:03:06,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:06,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:03:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:06,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:03:06,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:03:06,957 INFO L87 Difference]: Start difference. First operand 132 states and 198 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:07,192 INFO L93 Difference]: Finished difference Result 356 states and 533 transitions. [2024-11-16 12:03:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:03:07,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 12:03:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:07,195 INFO L225 Difference]: With dead ends: 356 [2024-11-16 12:03:07,196 INFO L226 Difference]: Without dead ends: 227 [2024-11-16 12:03:07,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:03:07,200 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 82 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:07,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 224 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:03:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-16 12:03:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 174. [2024-11-16 12:03:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 131 states have (on average 1.3893129770992367) internal successors, (182), 131 states have internal predecessors, (182), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 12:03:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2024-11-16 12:03:07,243 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 96 [2024-11-16 12:03:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:07,243 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2024-11-16 12:03:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2024-11-16 12:03:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 12:03:07,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:07,245 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:07,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:03:07,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2122937111, now seen corresponding path program 1 times [2024-11-16 12:03:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938194823] [2024-11-16 12:03:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938194823] [2024-11-16 12:03:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938194823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:09,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:09,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:03:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974443477] [2024-11-16 12:03:09,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:09,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:03:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:09,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:03:09,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:03:09,009 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:09,321 INFO L93 Difference]: Finished difference Result 356 states and 531 transitions. [2024-11-16 12:03:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:03:09,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 12:03:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:09,324 INFO L225 Difference]: With dead ends: 356 [2024-11-16 12:03:09,324 INFO L226 Difference]: Without dead ends: 227 [2024-11-16 12:03:09,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:03:09,325 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 123 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:09,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 262 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:03:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-16 12:03:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 180. [2024-11-16 12:03:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 137 states have (on average 1.3868613138686132) internal successors, (190), 137 states have internal predecessors, (190), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 12:03:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2024-11-16 12:03:09,350 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 96 [2024-11-16 12:03:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 268 transitions. [2024-11-16 12:03:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2024-11-16 12:03:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 12:03:09,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:09,352 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:03:09,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2006438357, now seen corresponding path program 1 times [2024-11-16 12:03:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746745292] [2024-11-16 12:03:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746745292] [2024-11-16 12:03:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746745292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:03:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227099473] [2024-11-16 12:03:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:03:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:03:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:03:12,046 INFO L87 Difference]: Start difference. First operand 180 states and 268 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:13,358 INFO L93 Difference]: Finished difference Result 465 states and 672 transitions. [2024-11-16 12:03:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 12:03:13,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 12:03:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:13,362 INFO L225 Difference]: With dead ends: 465 [2024-11-16 12:03:13,362 INFO L226 Difference]: Without dead ends: 336 [2024-11-16 12:03:13,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-16 12:03:13,364 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 349 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:13,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 421 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:03:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-11-16 12:03:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 194. [2024-11-16 12:03:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 149 states have internal predecessors, (204), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 12:03:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2024-11-16 12:03:13,388 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 96 [2024-11-16 12:03:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:13,389 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2024-11-16 12:03:13,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2024-11-16 12:03:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 12:03:13,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:13,391 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:13,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:03:13,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:13,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash 481074476, now seen corresponding path program 1 times [2024-11-16 12:03:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960909751] [2024-11-16 12:03:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:15,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960909751] [2024-11-16 12:03:15,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960909751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:15,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:15,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:03:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627145980] [2024-11-16 12:03:15,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:15,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:03:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:15,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:03:15,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:03:15,396 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:16,262 INFO L93 Difference]: Finished difference Result 492 states and 702 transitions. [2024-11-16 12:03:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 12:03:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 12:03:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:16,265 INFO L225 Difference]: With dead ends: 492 [2024-11-16 12:03:16,265 INFO L226 Difference]: Without dead ends: 332 [2024-11-16 12:03:16,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:03:16,266 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 245 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:16,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 370 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:03:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-16 12:03:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 259. [2024-11-16 12:03:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 214 states have (on average 1.3691588785046729) internal successors, (293), 214 states have internal predecessors, (293), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 12:03:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 371 transitions. [2024-11-16 12:03:16,287 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 371 transitions. Word has length 96 [2024-11-16 12:03:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:16,288 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 371 transitions. [2024-11-16 12:03:16,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 371 transitions. [2024-11-16 12:03:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 12:03:16,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:16,289 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:16,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:03:16,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:16,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -678873710, now seen corresponding path program 1 times [2024-11-16 12:03:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:16,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900261548] [2024-11-16 12:03:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:43,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900261548] [2024-11-16 12:03:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900261548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:43,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 12:03:43,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138429560] [2024-11-16 12:03:43,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:43,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 12:03:43,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:43,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 12:03:43,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:03:43,880 INFO L87 Difference]: Start difference. First operand 259 states and 371 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:44,453 INFO L93 Difference]: Finished difference Result 672 states and 958 transitions. [2024-11-16 12:03:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 12:03:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-16 12:03:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:44,457 INFO L225 Difference]: With dead ends: 672 [2024-11-16 12:03:44,457 INFO L226 Difference]: Without dead ends: 529 [2024-11-16 12:03:44,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:03:44,458 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 197 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:44,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 760 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:03:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-16 12:03:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 287. [2024-11-16 12:03:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 242 states have (on average 1.3884297520661157) internal successors, (336), 242 states have internal predecessors, (336), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 12:03:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 414 transitions. [2024-11-16 12:03:44,490 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 414 transitions. Word has length 97 [2024-11-16 12:03:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:44,491 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 414 transitions. [2024-11-16 12:03:44,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 414 transitions. [2024-11-16 12:03:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 12:03:44,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:44,492 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:44,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:03:44,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:44,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1189407887, now seen corresponding path program 1 times [2024-11-16 12:03:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955223834] [2024-11-16 12:03:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:03:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:03:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:03:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:03:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:03:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:03:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:03:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:03:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:03:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:03:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:03:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:03:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:03:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:03:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:03:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:03:45,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955223834] [2024-11-16 12:03:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955223834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:03:45,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:03:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:03:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594164789] [2024-11-16 12:03:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:03:45,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:03:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:03:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:03:45,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:03:45,382 INFO L87 Difference]: Start difference. First operand 287 states and 414 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:03:45,949 INFO L93 Difference]: Finished difference Result 569 states and 816 transitions. [2024-11-16 12:03:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 12:03:45,949 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-16 12:03:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:03:45,951 INFO L225 Difference]: With dead ends: 569 [2024-11-16 12:03:45,951 INFO L226 Difference]: Without dead ends: 489 [2024-11-16 12:03:45,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:03:45,952 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 275 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:03:45,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 750 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:03:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-16 12:03:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 375. [2024-11-16 12:03:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 315 states have (on average 1.3936507936507936) internal successors, (439), 315 states have internal predecessors, (439), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:03:45,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 543 transitions. [2024-11-16 12:03:45,978 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 543 transitions. Word has length 97 [2024-11-16 12:03:45,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:03:45,978 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 543 transitions. [2024-11-16 12:03:45,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:03:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 543 transitions. [2024-11-16 12:03:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 12:03:45,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:03:45,980 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:03:45,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:03:45,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:03:45,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:03:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash -503590602, now seen corresponding path program 1 times [2024-11-16 12:03:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:03:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538657329] [2024-11-16 12:03:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:03:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:03:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:04:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:04:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:04:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:04:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:04:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:04:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:04:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:04:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:04:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:04:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:04:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:04:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:04:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:04:14,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:04:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538657329] [2024-11-16 12:04:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538657329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:04:14,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:04:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 12:04:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770139531] [2024-11-16 12:04:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:04:14,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 12:04:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:04:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 12:04:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:04:14,388 INFO L87 Difference]: Start difference. First operand 375 states and 543 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:04:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:04:15,972 INFO L93 Difference]: Finished difference Result 785 states and 1120 transitions. [2024-11-16 12:04:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:04:15,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-16 12:04:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:04:15,975 INFO L225 Difference]: With dead ends: 785 [2024-11-16 12:04:15,975 INFO L226 Difference]: Without dead ends: 554 [2024-11-16 12:04:15,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2024-11-16 12:04:15,977 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 356 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:04:15,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 685 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 12:04:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-16 12:04:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 373. [2024-11-16 12:04:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 313 states have (on average 1.389776357827476) internal successors, (435), 313 states have internal predecessors, (435), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:04:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2024-11-16 12:04:16,005 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 539 transitions. Word has length 97 [2024-11-16 12:04:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:04:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 539 transitions. [2024-11-16 12:04:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:04:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 539 transitions. [2024-11-16 12:04:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 12:04:16,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:04:16,007 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:04:16,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 12:04:16,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:04:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:04:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1239219733, now seen corresponding path program 1 times [2024-11-16 12:04:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:04:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598385443] [2024-11-16 12:04:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:04:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:04:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:04:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:04:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 12:04:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:04:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:04:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:04:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:04:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:04:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:04:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:04:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 12:04:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:04:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:04:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 12:04:16,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:04:16,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598385443] [2024-11-16 12:04:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598385443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:04:16,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:04:16,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:04:16,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475821458] [2024-11-16 12:04:16,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:04:16,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:04:16,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:04:16,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:04:16,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:04:16,071 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:04:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:04:16,142 INFO L93 Difference]: Finished difference Result 900 states and 1315 transitions. [2024-11-16 12:04:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:04:16,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-16 12:04:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:04:16,146 INFO L225 Difference]: With dead ends: 900 [2024-11-16 12:04:16,146 INFO L226 Difference]: Without dead ends: 608 [2024-11-16 12:04:16,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:04:16,147 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:04:16,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 190 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:04:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-16 12:04:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 522. [2024-11-16 12:04:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 462 states have (on average 1.4155844155844155) internal successors, (654), 462 states have internal predecessors, (654), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 12:04:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 758 transitions. [2024-11-16 12:04:16,172 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 758 transitions. Word has length 97 [2024-11-16 12:04:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:04:16,173 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 758 transitions. [2024-11-16 12:04:16,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 12:04:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 758 transitions. [2024-11-16 12:04:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 12:04:16,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:04:16,174 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:04:16,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 12:04:16,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:04:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:04:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1003961207, now seen corresponding path program 1 times [2024-11-16 12:04:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:04:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801175956] [2024-11-16 12:04:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:04:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:04:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat