./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.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 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:01:35,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:01:35,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:01:35,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:01:35,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:01:35,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:01:35,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:01:35,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:01:35,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:01:35,411 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:01:35,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:01:35,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:01:35,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:01:35,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:01:35,412 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:01:35,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:01:35,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:01:35,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:01:35,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:01:35,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:01:35,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:01:35,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:01:35,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:01:35,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:01:35,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:01:35,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:01:35,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:01:35,416 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:01:35,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:01:35,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:01:35,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:01:35,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:01:35,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:35,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:01:35,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:01:35,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:01:35,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:01:35,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:01:35,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:01:35,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:01:35,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:01:35,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:01:35,419 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 -> 032103455c965390b2cd90e1021eb4797074287a2ad4fda3336b307fb716d96d [2024-11-12 05:01:35,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:01:35,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:01:35,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:01:35,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:01:35,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:01:35,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2024-11-12 05:01:37,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:01:37,526 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:01:37,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-63.i [2024-11-12 05:01:37,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a79ef8ad/230a51298c8640008310bafaf1e333e8/FLAG88bb2363e [2024-11-12 05:01:37,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a79ef8ad/230a51298c8640008310bafaf1e333e8 [2024-11-12 05:01:37,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:01:37,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:01:37,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:37,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:01:37,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:01:37,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:37" (1/1) ... [2024-11-12 05:01:37,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34763d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:37, skipping insertion in model container [2024-11-12 05:01:37,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:01:37" (1/1) ... [2024-11-12 05:01:37,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:01:38,018 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_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2024-11-12 05:01:38,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:38,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:01:38,110 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_loopvsstraightlinecode_100-1loop_file-63.i[916,929] [2024-11-12 05:01:38,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:01:38,176 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:01:38,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38 WrapperNode [2024-11-12 05:01:38,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:01:38,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:38,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:01:38,180 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:01:38,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,244 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2024-11-12 05:01:38,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:01:38,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:01:38,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:01:38,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:01:38,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,349 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-12 05:01:38,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:01:38,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:01:38,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:01:38,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:01:38,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (1/1) ... [2024-11-12 05:01:38,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:01:38,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:01:38,483 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-12 05:01:38,488 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-12 05:01:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:01:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:01:38,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:01:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:01:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:01:38,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:01:38,607 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:01:38,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:01:39,009 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-12 05:01:39,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:01:39,029 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:01:39,029 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:01:39,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:39 BoogieIcfgContainer [2024-11-12 05:01:39,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:01:39,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:01:39,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:01:39,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:01:39,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:01:37" (1/3) ... [2024-11-12 05:01:39,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff6977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:39, skipping insertion in model container [2024-11-12 05:01:39,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:01:38" (2/3) ... [2024-11-12 05:01:39,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bff6977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:01:39, skipping insertion in model container [2024-11-12 05:01:39,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:01:39" (3/3) ... [2024-11-12 05:01:39,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-63.i [2024-11-12 05:01:39,061 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:01:39,061 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:01:39,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:01:39,122 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;@4b04ada0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:01:39,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:01:39,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 05:01:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:39,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:39,136 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:39,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:39,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1384575058, now seen corresponding path program 1 times [2024-11-12 05:01:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906720037] [2024-11-12 05:01:39,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:01:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:01:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:01:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:01:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:01:39,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:39,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906720037] [2024-11-12 05:01:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906720037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:39,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:39,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:01:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679967953] [2024-11-12 05:01:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:39,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:01:39,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:39,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:01:39,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:01:39,732 INFO L87 Difference]: Start difference. First operand has 90 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:01:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:39,767 INFO L93 Difference]: Finished difference Result 175 states and 293 transitions. [2024-11-12 05:01:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:01:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2024-11-12 05:01:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:39,779 INFO L225 Difference]: With dead ends: 175 [2024-11-12 05:01:39,779 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 05:01:39,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:01:39,786 INFO L435 NwaCegarLoop]: 130 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, 130 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-12 05:01:39,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:01:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 05:01:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 05:01:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 05:01:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-12 05:01:39,830 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 143 [2024-11-12 05:01:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:39,834 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-12 05:01:39,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:01:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-12 05:01:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:39,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:39,839 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:39,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:01:39,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:39,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1680373646, now seen corresponding path program 1 times [2024-11-12 05:01:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:39,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513621917] [2024-11-12 05:01:39,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:01:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:01:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:01:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:01:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:01:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513621917] [2024-11-12 05:01:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513621917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:40,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:40,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:01:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800175296] [2024-11-12 05:01:40,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:40,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:01:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:40,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:01:40,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:01:40,168 INFO L87 Difference]: Start difference. First operand 84 states and 126 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:40,205 INFO L93 Difference]: Finished difference Result 166 states and 251 transitions. [2024-11-12 05:01:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:01:40,206 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-12 05:01:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:40,208 INFO L225 Difference]: With dead ends: 166 [2024-11-12 05:01:40,208 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 05:01:40,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-12 05:01:40,209 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:40,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:01:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 05:01:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 05:01:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-12 05:01:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-11-12 05:01:40,224 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 143 [2024-11-12 05:01:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:40,230 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-11-12 05:01:40,230 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-11-12 05:01:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:40,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:40,232 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:01:40,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:40,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash -849713454, now seen corresponding path program 1 times [2024-11-12 05:01:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635647265] [2024-11-12 05:01:40,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:01:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:01:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:01:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:01:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:01:40,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:40,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635647265] [2024-11-12 05:01:40,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635647265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:40,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:40,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:01:40,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55827913] [2024-11-12 05:01:40,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:40,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:01:40,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:40,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:01:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:01:40,702 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:40,887 INFO L93 Difference]: Finished difference Result 250 states and 376 transitions. [2024-11-12 05:01:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:01:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-12 05:01:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:40,889 INFO L225 Difference]: With dead ends: 250 [2024-11-12 05:01:40,889 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 05:01:40,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:01:40,891 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 93 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:40,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 353 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:01:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 05:01:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2024-11-12 05:01:40,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 05:01:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2024-11-12 05:01:40,907 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 143 [2024-11-12 05:01:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:40,908 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2024-11-12 05:01:40,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2024-11-12 05:01:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:40,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:40,910 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:40,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:01:40,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:40,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:40,911 INFO L85 PathProgramCache]: Analyzing trace with hash -983726960, now seen corresponding path program 1 times [2024-11-12 05:01:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:40,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160993974] [2024-11-12 05:01:40,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:01:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:01:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:01:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:01:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:01:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:41,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160993974] [2024-11-12 05:01:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160993974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:41,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:41,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:01:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478280680] [2024-11-12 05:01:41,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:01:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:01:41,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:01:41,284 INFO L87 Difference]: Start difference. First operand 132 states and 199 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:41,419 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2024-11-12 05:01:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:01:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-12 05:01:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:41,422 INFO L225 Difference]: With dead ends: 317 [2024-11-12 05:01:41,422 INFO L226 Difference]: Without dead ends: 235 [2024-11-12 05:01:41,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:01:41,427 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 191 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:41,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 292 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:01:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-12 05:01:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 186. [2024-11-12 05:01:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 135 states have internal predecessors, (182), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:01:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2024-11-12 05:01:41,459 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 143 [2024-11-12 05:01:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:41,460 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2024-11-12 05:01:41,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2024-11-12 05:01:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:41,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:41,463 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:41,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:01:41,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:41,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1348004724, now seen corresponding path program 1 times [2024-11-12 05:01:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128364836] [2024-11-12 05:01:41,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:01:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:01:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:01:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:01:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:01:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128364836] [2024-11-12 05:01:46,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128364836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:46,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:46,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:01:46,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108271016] [2024-11-12 05:01:46,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:46,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:01:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:46,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:01:46,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:01:46,508 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:47,042 INFO L93 Difference]: Finished difference Result 522 states and 768 transitions. [2024-11-12 05:01:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:01:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-12 05:01:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:47,048 INFO L225 Difference]: With dead ends: 522 [2024-11-12 05:01:47,049 INFO L226 Difference]: Without dead ends: 387 [2024-11-12 05:01:47,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:01:47,051 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 207 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:47,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 446 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:01:47,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-12 05:01:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 227. [2024-11-12 05:01:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 175 states have (on average 1.3885714285714286) internal successors, (243), 176 states have internal predecessors, (243), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:01:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 339 transitions. [2024-11-12 05:01:47,067 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 339 transitions. Word has length 143 [2024-11-12 05:01:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:47,067 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 339 transitions. [2024-11-12 05:01:47,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 339 transitions. [2024-11-12 05:01:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:47,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:47,069 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:01:47,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:47,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2137615946, now seen corresponding path program 1 times [2024-11-12 05:01:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315209130] [2024-11-12 05:01:47,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:01:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:01:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:01:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:01:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:01:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315209130] [2024-11-12 05:01:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315209130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 05:01:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115242980] [2024-11-12 05:01:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:54,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 05:01:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:54,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 05:01:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:01:54,170 INFO L87 Difference]: Start difference. First operand 227 states and 339 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:56,924 INFO L93 Difference]: Finished difference Result 816 states and 1186 transitions. [2024-11-12 05:01:56,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:01:56,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-12 05:01:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:56,927 INFO L225 Difference]: With dead ends: 816 [2024-11-12 05:01:56,927 INFO L226 Difference]: Without dead ends: 641 [2024-11-12 05:01:56,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2024-11-12 05:01:56,929 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 838 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:56,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 834 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 05:01:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-12 05:01:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 273. [2024-11-12 05:01:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.411764705882353) internal successors, (312), 222 states have internal predecessors, (312), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:01:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 408 transitions. [2024-11-12 05:01:56,970 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 408 transitions. Word has length 143 [2024-11-12 05:01:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 408 transitions. [2024-11-12 05:01:56,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 408 transitions. [2024-11-12 05:01:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:56,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:56,976 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:01:56,977 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -561025134, now seen corresponding path program 1 times [2024-11-12 05:01:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542010766] [2024-11-12 05:01:56,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:01:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:01:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:01:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:01:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:01:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:01:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:01:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:01:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:01:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:01:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:01:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:01:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:01:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:01:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:01:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:01:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:01:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:01:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:01:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:01:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:01:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:01:57,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:01:57,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542010766] [2024-11-12 05:01:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542010766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:01:57,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:01:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:01:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503958449] [2024-11-12 05:01:57,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:01:57,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:01:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:01:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:01:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:01:57,193 INFO L87 Difference]: Start difference. First operand 273 states and 408 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:01:57,340 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2024-11-12 05:01:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:01:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-12 05:01:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:01:57,343 INFO L225 Difference]: With dead ends: 519 [2024-11-12 05:01:57,344 INFO L226 Difference]: Without dead ends: 304 [2024-11-12 05:01:57,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:01:57,346 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 142 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:01:57,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 457 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:01:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-12 05:01:57,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 266. [2024-11-12 05:01:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 214 states have (on average 1.397196261682243) internal successors, (299), 215 states have internal predecessors, (299), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:01:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 395 transitions. [2024-11-12 05:01:57,368 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 395 transitions. Word has length 143 [2024-11-12 05:01:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:01:57,368 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 395 transitions. [2024-11-12 05:01:57,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:01:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 395 transitions. [2024-11-12 05:01:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 05:01:57,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:01:57,370 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:01:57,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 05:01:57,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:01:57,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:01:57,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1370371760, now seen corresponding path program 1 times [2024-11-12 05:01:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:01:57,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759876343] [2024-11-12 05:01:57,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:01:57,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:01:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759876343] [2024-11-12 05:02:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759876343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 05:02:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103174238] [2024-11-12 05:02:01,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:01,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 05:02:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:01,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 05:02:01,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:02:01,831 INFO L87 Difference]: Start difference. First operand 266 states and 395 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:03,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:03,081 INFO L93 Difference]: Finished difference Result 818 states and 1192 transitions. [2024-11-12 05:02:03,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 05:02:03,082 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2024-11-12 05:02:03,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:03,085 INFO L225 Difference]: With dead ends: 818 [2024-11-12 05:02:03,085 INFO L226 Difference]: Without dead ends: 622 [2024-11-12 05:02:03,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2024-11-12 05:02:03,087 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 564 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:03,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 719 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 05:02:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-12 05:02:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 311. [2024-11-12 05:02:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 259 states have (on average 1.4054054054054055) internal successors, (364), 260 states have internal predecessors, (364), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:02:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 460 transitions. [2024-11-12 05:02:03,102 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 460 transitions. Word has length 143 [2024-11-12 05:02:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:03,103 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 460 transitions. [2024-11-12 05:02:03,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 460 transitions. [2024-11-12 05:02:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 05:02:03,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:03,104 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:03,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 05:02:03,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1851192500, now seen corresponding path program 1 times [2024-11-12 05:02:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:03,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728304286] [2024-11-12 05:02:03,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:03,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:08,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728304286] [2024-11-12 05:02:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728304286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:08,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 05:02:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990332897] [2024-11-12 05:02:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:08,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 05:02:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 05:02:09,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-12 05:02:09,000 INFO L87 Difference]: Start difference. First operand 311 states and 460 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:10,558 INFO L93 Difference]: Finished difference Result 800 states and 1171 transitions. [2024-11-12 05:02:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 05:02:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-12 05:02:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:10,563 INFO L225 Difference]: With dead ends: 800 [2024-11-12 05:02:10,564 INFO L226 Difference]: Without dead ends: 583 [2024-11-12 05:02:10,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2024-11-12 05:02:10,566 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 674 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:10,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 826 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 05:02:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-12 05:02:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 321. [2024-11-12 05:02:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 269 states have (on average 1.420074349442379) internal successors, (382), 270 states have internal predecessors, (382), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:02:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 478 transitions. [2024-11-12 05:02:10,586 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 478 transitions. Word has length 144 [2024-11-12 05:02:10,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:10,587 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 478 transitions. [2024-11-12 05:02:10,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 478 transitions. [2024-11-12 05:02:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 05:02:10,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:10,588 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:10,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:02:10,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:10,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -785454913, now seen corresponding path program 1 times [2024-11-12 05:02:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944023440] [2024-11-12 05:02:10,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:10,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944023440] [2024-11-12 05:02:10,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944023440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:10,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:10,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:02:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928552586] [2024-11-12 05:02:10,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:10,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:02:10,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:10,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:02:10,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:02:10,686 INFO L87 Difference]: Start difference. First operand 321 states and 478 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:10,737 INFO L93 Difference]: Finished difference Result 697 states and 1028 transitions. [2024-11-12 05:02:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:02:10,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-12 05:02:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:10,740 INFO L225 Difference]: With dead ends: 697 [2024-11-12 05:02:10,740 INFO L226 Difference]: Without dead ends: 475 [2024-11-12 05:02:10,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:02:10,742 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 116 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:10,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 229 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:02:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-12 05:02:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2024-11-12 05:02:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 404 states have (on average 1.396039603960396) internal successors, (564), 407 states have internal predecessors, (564), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 05:02:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 684 transitions. [2024-11-12 05:02:10,762 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 684 transitions. Word has length 144 [2024-11-12 05:02:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:10,762 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 684 transitions. [2024-11-12 05:02:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:10,762 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 684 transitions. [2024-11-12 05:02:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 05:02:10,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:10,765 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:10,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 05:02:10,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:10,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1449621624, now seen corresponding path program 1 times [2024-11-12 05:02:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656146804] [2024-11-12 05:02:10,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656146804] [2024-11-12 05:02:14,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656146804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:14,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 05:02:14,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934118656] [2024-11-12 05:02:14,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:14,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:02:14,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:14,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:02:14,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:02:14,491 INFO L87 Difference]: Start difference. First operand 471 states and 684 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:15,684 INFO L93 Difference]: Finished difference Result 1291 states and 1868 transitions. [2024-11-12 05:02:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 05:02:15,685 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-12 05:02:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:15,688 INFO L225 Difference]: With dead ends: 1291 [2024-11-12 05:02:15,689 INFO L226 Difference]: Without dead ends: 954 [2024-11-12 05:02:15,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-12 05:02:15,690 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 460 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:15,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 588 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 05:02:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-11-12 05:02:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 506. [2024-11-12 05:02:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 439 states have (on average 1.4031890660592254) internal successors, (616), 442 states have internal predecessors, (616), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 05:02:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 736 transitions. [2024-11-12 05:02:15,714 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 736 transitions. Word has length 144 [2024-11-12 05:02:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:15,714 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 736 transitions. [2024-11-12 05:02:15,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 736 transitions. [2024-11-12 05:02:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 05:02:15,715 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:15,715 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:15,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 05:02:15,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:15,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:15,716 INFO L85 PathProgramCache]: Analyzing trace with hash 958425944, now seen corresponding path program 1 times [2024-11-12 05:02:15,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171338806] [2024-11-12 05:02:15,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:15,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171338806] [2024-11-12 05:02:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171338806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 05:02:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404115626] [2024-11-12 05:02:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:19,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 05:02:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 05:02:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:02:19,230 INFO L87 Difference]: Start difference. First operand 506 states and 736 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:20,668 INFO L93 Difference]: Finished difference Result 1352 states and 1966 transitions. [2024-11-12 05:02:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 05:02:20,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-12 05:02:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:20,673 INFO L225 Difference]: With dead ends: 1352 [2024-11-12 05:02:20,674 INFO L226 Difference]: Without dead ends: 925 [2024-11-12 05:02:20,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-11-12 05:02:20,682 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 509 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:20,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 794 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 05:02:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-12 05:02:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 700. [2024-11-12 05:02:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 632 states have (on average 1.4382911392405062) internal successors, (909), 635 states have internal predecessors, (909), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-12 05:02:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1029 transitions. [2024-11-12 05:02:20,716 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1029 transitions. Word has length 144 [2024-11-12 05:02:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:20,716 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1029 transitions. [2024-11-12 05:02:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1029 transitions. [2024-11-12 05:02:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 05:02:20,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:20,719 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:20,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 05:02:20,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 149079318, now seen corresponding path program 1 times [2024-11-12 05:02:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278785812] [2024-11-12 05:02:20,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:21,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:21,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278785812] [2024-11-12 05:02:21,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278785812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:21,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:21,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 05:02:21,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392675495] [2024-11-12 05:02:21,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:21,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:02:21,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:21,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:02:21,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:02:21,753 INFO L87 Difference]: Start difference. First operand 700 states and 1029 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:22,678 INFO L93 Difference]: Finished difference Result 1419 states and 2031 transitions. [2024-11-12 05:02:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 05:02:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-12 05:02:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:22,682 INFO L225 Difference]: With dead ends: 1419 [2024-11-12 05:02:22,683 INFO L226 Difference]: Without dead ends: 1035 [2024-11-12 05:02:22,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2024-11-12 05:02:22,685 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 420 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:22,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1053 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 05:02:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-12 05:02:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 835. [2024-11-12 05:02:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 761 states have (on average 1.4402102496714848) internal successors, (1096), 766 states have internal predecessors, (1096), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 05:02:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1224 transitions. [2024-11-12 05:02:22,722 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1224 transitions. Word has length 144 [2024-11-12 05:02:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:22,723 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1224 transitions. [2024-11-12 05:02:22,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1224 transitions. [2024-11-12 05:02:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 05:02:22,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:22,725 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:22,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 05:02:22,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:22,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1381127770, now seen corresponding path program 1 times [2024-11-12 05:02:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362671478] [2024-11-12 05:02:22,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:22,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:22,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362671478] [2024-11-12 05:02:22,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362671478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:22,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:22,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:02:22,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175229939] [2024-11-12 05:02:22,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:22,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:02:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:22,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:02:22,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:02:22,977 INFO L87 Difference]: Start difference. First operand 835 states and 1224 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:02:23,139 INFO L93 Difference]: Finished difference Result 1655 states and 2416 transitions. [2024-11-12 05:02:23,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:02:23,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-11-12 05:02:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:02:23,147 INFO L225 Difference]: With dead ends: 1655 [2024-11-12 05:02:23,147 INFO L226 Difference]: Without dead ends: 1237 [2024-11-12 05:02:23,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:02:23,149 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 216 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:02:23,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 508 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:02:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-12 05:02:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 879. [2024-11-12 05:02:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 805 states have (on average 1.439751552795031) internal successors, (1159), 810 states have internal predecessors, (1159), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 05:02:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1287 transitions. [2024-11-12 05:02:23,198 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1287 transitions. Word has length 144 [2024-11-12 05:02:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:02:23,200 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1287 transitions. [2024-11-12 05:02:23,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-12 05:02:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1287 transitions. [2024-11-12 05:02:23,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 05:02:23,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:02:23,202 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:02:23,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 05:02:23,202 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:02:23,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:02:23,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1304528217, now seen corresponding path program 1 times [2024-11-12 05:02:23,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:02:23,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006532730] [2024-11-12 05:02:23,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:02:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:02:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:02:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:02:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:02:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:02:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:02:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:02:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:02:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:02:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:02:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:02:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:02:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:02:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:02:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:02:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:02:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:02:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:02:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:02:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:02:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:02:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:02:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:02:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:02:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006532730] [2024-11-12 05:02:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006532730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:02:54,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:02:54,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-12 05:02:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818481848] [2024-11-12 05:02:54,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:02:54,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 05:02:54,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:02:54,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 05:02:54,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-12 05:02:54,572 INFO L87 Difference]: Start difference. First operand 879 states and 1287 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20)