./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.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 d2756a3afeabee0bd07615570da162530b76933ca347aab7efd24527f8af5fb3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:31:26,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:31:26,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:31:26,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:31:26,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:31:26,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:31:26,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:31:26,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:31:26,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:31:26,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:31:26,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:31:26,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:31:26,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:31:26,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:31:26,131 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:31:26,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:31:26,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:31:26,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:31:26,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:31:26,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:31:26,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:31:26,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:31:26,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:31:26,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:31:26,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:31:26,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:31:26,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:31:26,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:31:26,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:31:26,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:31:26,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:31:26,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:31:26,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:31:26,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:31:26,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:31:26,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:31:26,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:31:26,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:31:26,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:31:26,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:31:26,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:31:26,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:31:26,141 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 -> d2756a3afeabee0bd07615570da162530b76933ca347aab7efd24527f8af5fb3 [2024-11-20 05:31:26,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:31:26,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:31:26,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:31:26,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:31:26,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:31:26,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2024-11-20 05:31:27,972 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:31:28,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:31:28,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2024-11-20 05:31:28,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddabbe2d/45686d3ec38e483585ac65318274b8ab/FLAG6463d6d95 [2024-11-20 05:31:28,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bddabbe2d/45686d3ec38e483585ac65318274b8ab [2024-11-20 05:31:28,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:31:28,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:31:28,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:31:28,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:31:28,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:31:28,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1c77d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28, skipping insertion in model container [2024-11-20 05:31:28,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:31:28,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i[919,932] [2024-11-20 05:31:28,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:31:28,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:31:28,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i[919,932] [2024-11-20 05:31:28,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:31:28,582 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:31:28,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28 WrapperNode [2024-11-20 05:31:28,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:31:28,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:31:28,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:31:28,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:31:28,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,711 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-20 05:31:28,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:31:28,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:31:28,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:31:28,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:31:28,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,766 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-20 05:31:28,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:31:28,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:31:28,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:31:28,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:31:28,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (1/1) ... [2024-11-20 05:31:28,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:31:28,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:31:28,842 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-20 05:31:28,846 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-20 05:31:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:31:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:31:28,891 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:31:28,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:31:28,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:31:28,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:31:28,982 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:31:28,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:31:29,389 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 05:31:29,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:31:29,409 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:31:29,410 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:31:29,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:31:29 BoogieIcfgContainer [2024-11-20 05:31:29,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:31:29,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:31:29,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:31:29,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:31:29,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:31:28" (1/3) ... [2024-11-20 05:31:29,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460e1eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:31:29, skipping insertion in model container [2024-11-20 05:31:29,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:31:28" (2/3) ... [2024-11-20 05:31:29,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460e1eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:31:29, skipping insertion in model container [2024-11-20 05:31:29,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:31:29" (3/3) ... [2024-11-20 05:31:29,421 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-52.i [2024-11-20 05:31:29,439 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:31:29,439 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:31:29,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:31:29,511 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;@39178e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:31:29,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:31:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:31:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 05:31:29,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:29,532 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:29,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:29,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash -417909114, now seen corresponding path program 1 times [2024-11-20 05:31:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:29,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518293472] [2024-11-20 05:31:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:29,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:29,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:30,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:30,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518293472] [2024-11-20 05:31:30,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518293472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:30,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:30,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:31:30,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295647497] [2024-11-20 05:31:30,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:30,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:31:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:30,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:31:30,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:31:30,159 INFO L87 Difference]: Start difference. First operand has 88 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:31:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:30,200 INFO L93 Difference]: Finished difference Result 169 states and 288 transitions. [2024-11-20 05:31:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:31:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 153 [2024-11-20 05:31:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:30,210 INFO L225 Difference]: With dead ends: 169 [2024-11-20 05:31:30,211 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 05:31:30,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-20 05:31:30,219 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:30,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:31:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 05:31:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-20 05:31:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 05:31:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 129 transitions. [2024-11-20 05:31:30,278 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 129 transitions. Word has length 153 [2024-11-20 05:31:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:30,279 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 129 transitions. [2024-11-20 05:31:30,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 05:31:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 129 transitions. [2024-11-20 05:31:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 05:31:30,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:30,284 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:31:30,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:30,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -572067138, now seen corresponding path program 1 times [2024-11-20 05:31:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:30,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364245618] [2024-11-20 05:31:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:30,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364245618] [2024-11-20 05:31:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364245618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:30,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:31:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762515962] [2024-11-20 05:31:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:30,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:31:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:30,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:31:30,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:31:30,758 INFO L87 Difference]: Start difference. First operand 84 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:30,825 INFO L93 Difference]: Finished difference Result 246 states and 381 transitions. [2024-11-20 05:31:30,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:31:30,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-11-20 05:31:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:30,832 INFO L225 Difference]: With dead ends: 246 [2024-11-20 05:31:30,832 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 05:31:30,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-20 05:31:30,837 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:30,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:31:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 05:31:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2024-11-20 05:31:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 115 states have internal predecessors, (163), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 05:31:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 251 transitions. [2024-11-20 05:31:30,871 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 251 transitions. Word has length 153 [2024-11-20 05:31:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:30,872 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 251 transitions. [2024-11-20 05:31:30,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 251 transitions. [2024-11-20 05:31:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 05:31:30,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:30,876 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:30,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:31:30,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:30,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash -347069248, now seen corresponding path program 1 times [2024-11-20 05:31:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591536979] [2024-11-20 05:31:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:31,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:31,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591536979] [2024-11-20 05:31:31,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591536979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:31,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:31,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:31:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028782980] [2024-11-20 05:31:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:31,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:31:31,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:31,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:31:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:31:31,425 INFO L87 Difference]: Start difference. First operand 162 states and 251 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:31,507 INFO L93 Difference]: Finished difference Result 480 states and 747 transitions. [2024-11-20 05:31:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:31:31,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-20 05:31:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:31,511 INFO L225 Difference]: With dead ends: 480 [2024-11-20 05:31:31,511 INFO L226 Difference]: Without dead ends: 321 [2024-11-20 05:31:31,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-20 05:31:31,518 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 87 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:31,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 241 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:31:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-20 05:31:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2024-11-20 05:31:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 226 states have (on average 1.415929203539823) internal successors, (320), 226 states have internal predecessors, (320), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-20 05:31:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 496 transitions. [2024-11-20 05:31:31,593 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 496 transitions. Word has length 154 [2024-11-20 05:31:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:31,594 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 496 transitions. [2024-11-20 05:31:31,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 496 transitions. [2024-11-20 05:31:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 05:31:31,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:31,597 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:31,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:31:31,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:31,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -803671258, now seen corresponding path program 1 times [2024-11-20 05:31:31,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:31,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347174519] [2024-11-20 05:31:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:31,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:32,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:32,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347174519] [2024-11-20 05:31:32,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347174519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:32,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:31:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663652469] [2024-11-20 05:31:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:32,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:31:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:32,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:31:32,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:31:32,553 INFO L87 Difference]: Start difference. First operand 319 states and 496 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:32,694 INFO L93 Difference]: Finished difference Result 697 states and 1085 transitions. [2024-11-20 05:31:32,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:31:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-20 05:31:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:32,698 INFO L225 Difference]: With dead ends: 697 [2024-11-20 05:31:32,698 INFO L226 Difference]: Without dead ends: 381 [2024-11-20 05:31:32,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-20 05:31:32,700 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:32,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 213 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:31:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-20 05:31:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 371. [2024-11-20 05:31:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 255 states have (on average 1.384313725490196) internal successors, (353), 255 states have internal predecessors, (353), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-20 05:31:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 573 transitions. [2024-11-20 05:31:32,753 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 573 transitions. Word has length 155 [2024-11-20 05:31:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 573 transitions. [2024-11-20 05:31:32,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 573 transitions. [2024-11-20 05:31:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 05:31:32,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:32,756 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:32,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:31:32,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:32,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1277742239, now seen corresponding path program 1 times [2024-11-20 05:31:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896959619] [2024-11-20 05:31:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:32,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:32,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896959619] [2024-11-20 05:31:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896959619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:31:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755399039] [2024-11-20 05:31:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:32,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:31:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:32,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:31:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:31:32,939 INFO L87 Difference]: Start difference. First operand 371 states and 573 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:33,009 INFO L93 Difference]: Finished difference Result 719 states and 1122 transitions. [2024-11-20 05:31:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:31:33,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-11-20 05:31:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:33,015 INFO L225 Difference]: With dead ends: 719 [2024-11-20 05:31:33,015 INFO L226 Difference]: Without dead ends: 403 [2024-11-20 05:31:33,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-20 05:31:33,017 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:33,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:31:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-20 05:31:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2024-11-20 05:31:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 263 states have (on average 1.3878326996197718) internal successors, (365), 263 states have internal predecessors, (365), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-20 05:31:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 585 transitions. [2024-11-20 05:31:33,071 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 585 transitions. Word has length 156 [2024-11-20 05:31:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:33,072 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 585 transitions. [2024-11-20 05:31:33,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 585 transitions. [2024-11-20 05:31:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 05:31:33,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:33,076 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:33,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:31:33,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:33,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash -63484420, now seen corresponding path program 1 times [2024-11-20 05:31:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:33,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781111109] [2024-11-20 05:31:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:33,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:33,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781111109] [2024-11-20 05:31:33,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781111109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:33,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:33,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:31:33,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814299745] [2024-11-20 05:31:33,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:33,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:31:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:33,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:31:33,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:31:33,373 INFO L87 Difference]: Start difference. First operand 379 states and 585 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:33,464 INFO L93 Difference]: Finished difference Result 713 states and 1107 transitions. [2024-11-20 05:31:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:31:33,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-20 05:31:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:33,470 INFO L225 Difference]: With dead ends: 713 [2024-11-20 05:31:33,471 INFO L226 Difference]: Without dead ends: 389 [2024-11-20 05:31:33,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-20 05:31:33,474 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 47 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:33,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 230 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:31:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-20 05:31:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 380. [2024-11-20 05:31:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 264 states have (on average 1.3863636363636365) internal successors, (366), 264 states have internal predecessors, (366), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-20 05:31:33,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 586 transitions. [2024-11-20 05:31:33,525 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 586 transitions. Word has length 157 [2024-11-20 05:31:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:33,526 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 586 transitions. [2024-11-20 05:31:33,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 586 transitions. [2024-11-20 05:31:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 05:31:33,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:33,528 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:33,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:31:33,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:33,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:33,529 INFO L85 PathProgramCache]: Analyzing trace with hash -20546141, now seen corresponding path program 1 times [2024-11-20 05:31:33,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520415228] [2024-11-20 05:31:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:33,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:34,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:34,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520415228] [2024-11-20 05:31:34,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520415228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:34,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:34,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:31:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163368387] [2024-11-20 05:31:34,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:34,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:31:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:34,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:31:34,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:31:34,500 INFO L87 Difference]: Start difference. First operand 380 states and 586 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:34,815 INFO L93 Difference]: Finished difference Result 723 states and 1119 transitions. [2024-11-20 05:31:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:31:34,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-20 05:31:34,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:34,820 INFO L225 Difference]: With dead ends: 723 [2024-11-20 05:31:34,820 INFO L226 Difference]: Without dead ends: 387 [2024-11-20 05:31:34,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:31:34,823 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 52 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:34,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 367 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 05:31:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-20 05:31:34,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 380. [2024-11-20 05:31:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 264 states have (on average 1.3825757575757576) internal successors, (365), 264 states have internal predecessors, (365), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-20 05:31:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 585 transitions. [2024-11-20 05:31:34,864 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 585 transitions. Word has length 157 [2024-11-20 05:31:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:34,866 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 585 transitions. [2024-11-20 05:31:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 585 transitions. [2024-11-20 05:31:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 05:31:34,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:34,868 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:34,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:31:34,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1668397601, now seen corresponding path program 1 times [2024-11-20 05:31:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064549795] [2024-11-20 05:31:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:44,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064549795] [2024-11-20 05:31:44,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064549795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:44,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:44,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 05:31:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200392020] [2024-11-20 05:31:44,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:44,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 05:31:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:44,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 05:31:44,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:31:44,961 INFO L87 Difference]: Start difference. First operand 380 states and 585 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:50,448 INFO L93 Difference]: Finished difference Result 714 states and 1069 transitions. [2024-11-20 05:31:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-20 05:31:50,449 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-20 05:31:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:50,457 INFO L225 Difference]: With dead ends: 714 [2024-11-20 05:31:50,459 INFO L226 Difference]: Without dead ends: 712 [2024-11-20 05:31:50,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=567, Invalid=1689, Unknown=0, NotChecked=0, Total=2256 [2024-11-20 05:31:50,461 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 406 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:50,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 735 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 05:31:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-20 05:31:50,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 573. [2024-11-20 05:31:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 411 states have (on average 1.391727493917275) internal successors, (572), 411 states have internal predecessors, (572), 154 states have call successors, (154), 7 states have call predecessors, (154), 7 states have return successors, (154), 154 states have call predecessors, (154), 154 states have call successors, (154) [2024-11-20 05:31:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 880 transitions. [2024-11-20 05:31:50,517 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 880 transitions. Word has length 157 [2024-11-20 05:31:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:50,517 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 880 transitions. [2024-11-20 05:31:50,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 880 transitions. [2024-11-20 05:31:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 05:31:50,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:50,519 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:50,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 05:31:50,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:50,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1926563039, now seen corresponding path program 1 times [2024-11-20 05:31:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:50,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064214541] [2024-11-20 05:31:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:31:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:31:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:31:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:31:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:31:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:31:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 05:31:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:31:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:31:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 05:31:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 05:31:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 05:31:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 05:31:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 05:31:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 05:31:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 05:31:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 05:31:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:31:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:31:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:31:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 05:31:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 05:31:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:31:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 05:31:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:31:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064214541] [2024-11-20 05:31:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064214541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:31:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:31:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:31:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557348767] [2024-11-20 05:31:50,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:31:50,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:31:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:31:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:31:50,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:31:50,721 INFO L87 Difference]: Start difference. First operand 573 states and 880 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:31:50,861 INFO L93 Difference]: Finished difference Result 1213 states and 1876 transitions. [2024-11-20 05:31:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:31:50,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-20 05:31:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:31:50,866 INFO L225 Difference]: With dead ends: 1213 [2024-11-20 05:31:50,866 INFO L226 Difference]: Without dead ends: 696 [2024-11-20 05:31:50,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-20 05:31:50,868 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 142 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:31:50,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 502 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:31:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2024-11-20 05:31:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 496. [2024-11-20 05:31:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 357 states have (on average 1.3949579831932772) internal successors, (498), 357 states have internal predecessors, (498), 132 states have call successors, (132), 6 states have call predecessors, (132), 6 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-20 05:31:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 762 transitions. [2024-11-20 05:31:50,918 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 762 transitions. Word has length 157 [2024-11-20 05:31:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:31:50,919 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 762 transitions. [2024-11-20 05:31:50,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 05:31:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 762 transitions. [2024-11-20 05:31:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 05:31:50,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:31:50,920 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:31:50,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 05:31:50,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:31:50,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:31:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 353835297, now seen corresponding path program 1 times [2024-11-20 05:31:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:31:50,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886596619] [2024-11-20 05:31:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:31:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:31:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat