./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-81.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 139d16f6f2adc0a53ed334bc0ef4cd475497ad47ce08b4367552becb4de333c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:48:22,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:48:22,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:48:22,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:48:22,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:48:22,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:48:22,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:48:22,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:48:22,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:48:22,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:48:22,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:48:22,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:48:22,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:48:22,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:48:22,170 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:48:22,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:48:22,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:48:22,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:48:22,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:48:22,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:48:22,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:48:22,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:48:22,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:48:22,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:48:22,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:48:22,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:48:22,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:48:22,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:48:22,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:48:22,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:48:22,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:48:22,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:48:22,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:48:22,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:48:22,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:48:22,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:48:22,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:48:22,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:48:22,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:48:22,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:48:22,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:48:22,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:48:22,179 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-clean/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-clean/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 -> 139d16f6f2adc0a53ed334bc0ef4cd475497ad47ce08b4367552becb4de333c7 [2024-10-11 07:48:22,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:48:22,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:48:22,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:48:22,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:48:22,414 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:48:22,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-81.i [2024-10-11 07:48:23,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:48:23,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:48:23,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-81.i [2024-10-11 07:48:23,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11bfec38e/9d4d1175b1cd4122b6a4a2f30d9188ac/FLAGf805ac8f2 [2024-10-11 07:48:23,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11bfec38e/9d4d1175b1cd4122b6a4a2f30d9188ac [2024-10-11 07:48:23,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:48:23,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:48:23,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:48:23,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:48:23,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:48:23,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:48:23" (1/1) ... [2024-10-11 07:48:23,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d9a63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:23, skipping insertion in model container [2024-10-11 07:48:23,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:48:23" (1/1) ... [2024-10-11 07:48:23,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:48:24,230 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-81.i[913,926] [2024-10-11 07:48:24,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:48:24,290 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:48:24,301 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-81.i[913,926] [2024-10-11 07:48:24,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:48:24,350 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:48:24,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24 WrapperNode [2024-10-11 07:48:24,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:48:24,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:48:24,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:48:24,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:48:24,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,414 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-11 07:48:24,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:48:24,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:48:24,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:48:24,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:48:24,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,461 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-10-11 07:48:24,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:48:24,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:48:24,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:48:24,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:48:24,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (1/1) ... [2024-10-11 07:48:24,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:48:24,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:48:24,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:48:24,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:48:24,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:48:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:48:24,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:48:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:48:24,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:48:24,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:48:24,651 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:48:24,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:48:24,950 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:48:24,950 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:48:24,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:48:24,984 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:48:24,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:24 BoogieIcfgContainer [2024-10-11 07:48:24,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:48:24,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:48:24,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:48:24,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:48:24,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:48:23" (1/3) ... [2024-10-11 07:48:24,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2900ea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:48:24, skipping insertion in model container [2024-10-11 07:48:24,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:48:24" (2/3) ... [2024-10-11 07:48:24,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2900ea98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:48:24, skipping insertion in model container [2024-10-11 07:48:24,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:48:24" (3/3) ... [2024-10-11 07:48:24,997 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-81.i [2024-10-11 07:48:25,012 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:48:25,012 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:48:25,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:48:25,074 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;@7784d33d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:48:25,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:48:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:48:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 07:48:25,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:25,099 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:25,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:25,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1234853277, now seen corresponding path program 1 times [2024-10-11 07:48:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:25,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723721058] [2024-10-11 07:48:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:25,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:48:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:48:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:48:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:48:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:48:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:48:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:48:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:48:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:48:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:48:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:48:25,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:25,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723721058] [2024-10-11 07:48:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723721058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:25,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:25,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:48:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079661490] [2024-10-11 07:48:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:48:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:48:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:48:25,651 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:48:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:25,692 INFO L93 Difference]: Finished difference Result 139 states and 248 transitions. [2024-10-11 07:48:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:48:25,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 159 [2024-10-11 07:48:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:25,702 INFO L225 Difference]: With dead ends: 139 [2024-10-11 07:48:25,702 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 07:48:25,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-11 07:48:25,711 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:25,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:48:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 07:48:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 07:48:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:48:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 107 transitions. [2024-10-11 07:48:25,759 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 107 transitions. Word has length 159 [2024-10-11 07:48:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:25,761 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 107 transitions. [2024-10-11 07:48:25,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:48:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 107 transitions. [2024-10-11 07:48:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 07:48:25,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:25,764 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:25,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:48:25,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:25,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash -125328291, now seen corresponding path program 1 times [2024-10-11 07:48:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721566389] [2024-10-11 07:48:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:25,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:48:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:48:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:48:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:48:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:48:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:48:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:48:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:48:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:48:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:48:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:48:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721566389] [2024-10-11 07:48:35,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721566389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:35,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:35,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:48:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886735769] [2024-10-11 07:48:35,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:35,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:48:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:48:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:48:35,551 INFO L87 Difference]: Start difference. First operand 69 states and 107 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:37,368 INFO L93 Difference]: Finished difference Result 218 states and 329 transitions. [2024-10-11 07:48:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:48:37,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 07:48:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:37,378 INFO L225 Difference]: With dead ends: 218 [2024-10-11 07:48:37,378 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 07:48:37,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:48:37,380 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 262 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:37,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 430 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:48:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 07:48:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 82. [2024-10-11 07:48:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:48:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-11 07:48:37,400 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 159 [2024-10-11 07:48:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:37,403 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-11 07:48:37,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-11 07:48:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 07:48:37,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:37,407 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:37,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:48:37,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:37,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 554730079, now seen corresponding path program 1 times [2024-10-11 07:48:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:37,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826551877] [2024-10-11 07:48:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:48:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:48:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:48:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:48:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:48:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:48:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:48:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:48:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:48:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:48:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:48:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826551877] [2024-10-11 07:48:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826551877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:48:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856629233] [2024-10-11 07:48:37,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:37,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:48:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:37,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:48:37,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:48:37,603 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:37,661 INFO L93 Difference]: Finished difference Result 193 states and 295 transitions. [2024-10-11 07:48:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:48:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 07:48:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:37,664 INFO L225 Difference]: With dead ends: 193 [2024-10-11 07:48:37,664 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 07:48:37,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:48:37,665 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:37,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 301 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:48:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 07:48:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-10-11 07:48:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.368421052631579) internal successors, (104), 77 states have internal predecessors, (104), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:48:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 164 transitions. [2024-10-11 07:48:37,677 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 164 transitions. Word has length 159 [2024-10-11 07:48:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:37,678 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 164 transitions. [2024-10-11 07:48:37,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 164 transitions. [2024-10-11 07:48:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 07:48:37,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:37,684 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:48:37,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:37,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -518355301, now seen corresponding path program 1 times [2024-10-11 07:48:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018978856] [2024-10-11 07:48:37,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:48:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:48:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:48:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:48:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:48:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:48:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:48:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:48:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:48:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:48:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:48:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018978856] [2024-10-11 07:48:45,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018978856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:45,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:45,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:48:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122401778] [2024-10-11 07:48:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:45,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:48:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:48:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:48:45,346 INFO L87 Difference]: Start difference. First operand 109 states and 164 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:48,168 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2024-10-11 07:48:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 07:48:48,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 07:48:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:48,173 INFO L225 Difference]: With dead ends: 386 [2024-10-11 07:48:48,175 INFO L226 Difference]: Without dead ends: 278 [2024-10-11 07:48:48,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-11 07:48:48,181 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 404 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:48,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 507 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 07:48:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-11 07:48:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 158. [2024-10-11 07:48:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.3265306122448979) internal successors, (130), 99 states have internal predecessors, (130), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 07:48:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2024-10-11 07:48:48,253 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 159 [2024-10-11 07:48:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:48,254 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2024-10-11 07:48:48,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2024-10-11 07:48:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 07:48:48,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:48,260 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:48,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:48:48,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:48,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:48,261 INFO L85 PathProgramCache]: Analyzing trace with hash 575736287, now seen corresponding path program 1 times [2024-10-11 07:48:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986179119] [2024-10-11 07:48:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:48:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:48:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:48:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:48:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:48:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:48:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:48:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:48:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:49,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:48:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:49,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:48:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:48:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986179119] [2024-10-11 07:48:49,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986179119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:49,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:49,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:48:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279129426] [2024-10-11 07:48:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:49,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:48:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:48:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:48:49,019 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:49,371 INFO L93 Difference]: Finished difference Result 319 states and 482 transitions. [2024-10-11 07:48:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:48:49,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 07:48:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:49,374 INFO L225 Difference]: With dead ends: 319 [2024-10-11 07:48:49,375 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 07:48:49,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:48:49,377 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 96 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:49,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 411 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:48:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 07:48:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 164. [2024-10-11 07:48:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 07:48:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2024-10-11 07:48:49,403 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 159 [2024-10-11 07:48:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:49,403 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2024-10-11 07:48:49,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2024-10-11 07:48:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 07:48:49,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:49,405 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:49,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:48:49,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:49,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1105161315, now seen corresponding path program 1 times [2024-10-11 07:48:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:49,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996254958] [2024-10-11 07:48:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:48:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:48:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:48:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:48:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:48:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:48:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:48:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:48:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:48:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:48:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:48:57,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:57,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996254958] [2024-10-11 07:48:57,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996254958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:57,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:57,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:48:57,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136438042] [2024-10-11 07:48:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:57,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:48:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:57,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:48:57,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:48:57,968 INFO L87 Difference]: Start difference. First operand 164 states and 249 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:59,551 INFO L93 Difference]: Finished difference Result 337 states and 503 transitions. [2024-10-11 07:48:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:48:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 159 [2024-10-11 07:48:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:59,554 INFO L225 Difference]: With dead ends: 337 [2024-10-11 07:48:59,554 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 07:48:59,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:48:59,556 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 200 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:59,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 381 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:48:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 07:48:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 162. [2024-10-11 07:48:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 103 states have internal predecessors, (135), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 07:48:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 247 transitions. [2024-10-11 07:48:59,574 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 247 transitions. Word has length 159 [2024-10-11 07:48:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:59,574 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 247 transitions. [2024-10-11 07:48:59,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 247 transitions. [2024-10-11 07:48:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:48:59,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:59,576 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:59,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:48:59,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:59,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 678860108, now seen corresponding path program 1 times [2024-10-11 07:48:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:59,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934027324] [2024-10-11 07:48:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:48:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:48:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:48:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:48:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:48:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:48:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:48:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:48:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:48:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:48:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:48:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:48:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:48:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:48:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:48:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:48:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:48:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:48:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:48:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:48:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:48:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:48:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:48:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:48:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:48:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:48:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:48:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:48:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:48:59,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:48:59,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934027324] [2024-10-11 07:48:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934027324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:48:59,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:48:59,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:48:59,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817327924] [2024-10-11 07:48:59,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:48:59,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:48:59,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:48:59,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:48:59,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:48:59,788 INFO L87 Difference]: Start difference. First operand 162 states and 247 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:48:59,956 INFO L93 Difference]: Finished difference Result 296 states and 441 transitions. [2024-10-11 07:48:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:48:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 07:48:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:48:59,958 INFO L225 Difference]: With dead ends: 296 [2024-10-11 07:48:59,959 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 07:48:59,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:48:59,960 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 58 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:48:59,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 300 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:48:59,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 07:48:59,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 159. [2024-10-11 07:48:59,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:48:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 238 transitions. [2024-10-11 07:48:59,981 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 238 transitions. Word has length 160 [2024-10-11 07:48:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:48:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 238 transitions. [2024-10-11 07:48:59,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:48:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 238 transitions. [2024-10-11 07:48:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:48:59,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:48:59,985 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:48:59,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:48:59,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:48:59,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:48:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1358918478, now seen corresponding path program 1 times [2024-10-11 07:48:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:48:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659975516] [2024-10-11 07:48:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:48:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:49:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:49:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:49:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:49:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:49:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:49:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:49:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:49:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:49:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:49:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:49:05,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:05,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659975516] [2024-10-11 07:49:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659975516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:05,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 07:49:05,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380714852] [2024-10-11 07:49:05,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:05,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 07:49:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:05,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 07:49:05,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:49:05,653 INFO L87 Difference]: Start difference. First operand 159 states and 238 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:49:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:07,315 INFO L93 Difference]: Finished difference Result 353 states and 515 transitions. [2024-10-11 07:49:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:49:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-11 07:49:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:07,318 INFO L225 Difference]: With dead ends: 353 [2024-10-11 07:49:07,318 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 07:49:07,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2024-10-11 07:49:07,319 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 227 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:07,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 641 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 07:49:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 07:49:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 169. [2024-10-11 07:49:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 112 states have internal predecessors, (148), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:49:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2024-10-11 07:49:07,338 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 160 [2024-10-11 07:49:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:07,338 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2024-10-11 07:49:07,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:49:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2024-10-11 07:49:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:49:07,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:07,340 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:49:07,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:07,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash 965891468, now seen corresponding path program 1 times [2024-10-11 07:49:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:07,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087542731] [2024-10-11 07:49:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:49:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:49:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:49:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:49:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:49:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:49:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:49:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:49:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:49:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:49:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:49:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087542731] [2024-10-11 07:49:13,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087542731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:13,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:13,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:49:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834864692] [2024-10-11 07:49:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:13,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:49:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:49:13,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:49:13,073 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:49:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:14,342 INFO L93 Difference]: Finished difference Result 324 states and 477 transitions. [2024-10-11 07:49:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:49:14,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-11 07:49:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:14,344 INFO L225 Difference]: With dead ends: 324 [2024-10-11 07:49:14,344 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 07:49:14,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2024-10-11 07:49:14,345 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 145 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:14,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 565 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:49:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 07:49:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 167. [2024-10-11 07:49:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:49:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2024-10-11 07:49:14,361 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 160 [2024-10-11 07:49:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:14,361 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2024-10-11 07:49:14,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:49:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2024-10-11 07:49:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:49:14,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:14,362 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:14,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 07:49:14,363 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:14,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1689977358, now seen corresponding path program 1 times [2024-10-11 07:49:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30243705] [2024-10-11 07:49:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:49:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:49:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:49:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:49:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:49:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:49:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:49:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:49:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:49:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:49:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:49:19,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:19,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30243705] [2024-10-11 07:49:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30243705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:19,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:49:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034258379] [2024-10-11 07:49:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:19,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:49:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:49:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:49:19,414 INFO L87 Difference]: Start difference. First operand 167 states and 250 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:20,735 INFO L93 Difference]: Finished difference Result 398 states and 577 transitions. [2024-10-11 07:49:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:49:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 07:49:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:20,738 INFO L225 Difference]: With dead ends: 398 [2024-10-11 07:49:20,738 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 07:49:20,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2024-10-11 07:49:20,739 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 396 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:20,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 476 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 07:49:20,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 07:49:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 171. [2024-10-11 07:49:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 114 states have internal predecessors, (152), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:49:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2024-10-11 07:49:20,754 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 160 [2024-10-11 07:49:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:20,755 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2024-10-11 07:49:20,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2024-10-11 07:49:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:49:20,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:20,757 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:20,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 07:49:20,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1924931568, now seen corresponding path program 1 times [2024-10-11 07:49:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759454453] [2024-10-11 07:49:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:49:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:49:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:49:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:49:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:49:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:49:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:49:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:49:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:49:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:49:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:49:24,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:24,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759454453] [2024-10-11 07:49:24,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759454453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:24,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:49:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634946984] [2024-10-11 07:49:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:24,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:49:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:24,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:49:24,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:49:24,827 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:49:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:26,031 INFO L93 Difference]: Finished difference Result 360 states and 526 transitions. [2024-10-11 07:49:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:49:26,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-11 07:49:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:26,037 INFO L225 Difference]: With dead ends: 360 [2024-10-11 07:49:26,037 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 07:49:26,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-11 07:49:26,038 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 274 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:26,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 593 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:49:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 07:49:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 173. [2024-10-11 07:49:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:49:26,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2024-10-11 07:49:26,078 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 160 [2024-10-11 07:49:26,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:26,079 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2024-10-11 07:49:26,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:49:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2024-10-11 07:49:26,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:49:26,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:26,080 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:26,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 07:49:26,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:26,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1296950348, now seen corresponding path program 1 times [2024-10-11 07:49:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:26,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760454642] [2024-10-11 07:49:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:49:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:49:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:49:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:49:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:49:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:49:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:49:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:49:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:49:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:49:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:49:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:29,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760454642] [2024-10-11 07:49:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760454642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:29,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:49:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528880555] [2024-10-11 07:49:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:29,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:49:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:29,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:49:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:49:29,931 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:35,342 INFO L93 Difference]: Finished difference Result 410 states and 591 transitions. [2024-10-11 07:49:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 07:49:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 07:49:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:35,344 INFO L225 Difference]: With dead ends: 410 [2024-10-11 07:49:35,344 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 07:49:35,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2024-10-11 07:49:35,345 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 307 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:35,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 608 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 07:49:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 07:49:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 174. [2024-10-11 07:49:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:49:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2024-10-11 07:49:35,365 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 262 transitions. Word has length 160 [2024-10-11 07:49:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:35,365 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-10-11 07:49:35,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2024-10-11 07:49:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:49:35,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:35,366 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:35,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 07:49:35,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:35,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1977008718, now seen corresponding path program 1 times [2024-10-11 07:49:35,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:35,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725710075] [2024-10-11 07:49:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:49:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:49:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:49:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:49:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:49:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:49:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:49:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:49:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:49:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:49:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:49:41,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:41,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725710075] [2024-10-11 07:49:41,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725710075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:41,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:41,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:49:41,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281301751] [2024-10-11 07:49:41,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:41,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:49:41,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:41,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:49:41,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:49:41,899 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:42,844 INFO L93 Difference]: Finished difference Result 345 states and 506 transitions. [2024-10-11 07:49:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:49:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 07:49:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:42,846 INFO L225 Difference]: With dead ends: 345 [2024-10-11 07:49:42,846 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 07:49:42,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:49:42,847 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 168 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:42,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 491 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:49:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 07:49:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 173. [2024-10-11 07:49:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:49:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2024-10-11 07:49:42,862 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 160 [2024-10-11 07:49:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:42,863 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2024-10-11 07:49:42,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2024-10-11 07:49:42,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:49:42,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:42,864 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:42,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 07:49:42,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:42,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1103171344, now seen corresponding path program 1 times [2024-10-11 07:49:42,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:42,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405059191] [2024-10-11 07:49:42,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:49:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:49:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:49:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:49:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:49:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:49:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:49:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:49:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:49:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:49:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:49:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:49:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:49:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:49:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:49:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:49:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:49:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:49:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:49:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:49:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:49:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:49:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:49:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:49:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:49:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 07:49:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:49:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:49:48,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:49:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405059191] [2024-10-11 07:49:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405059191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:49:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:49:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:49:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855560238] [2024-10-11 07:49:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:49:48,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:49:48,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:49:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:49:48,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:49:48,188 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:49:50,774 INFO L93 Difference]: Finished difference Result 399 states and 575 transitions. [2024-10-11 07:49:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 07:49:50,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-11 07:49:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:49:50,777 INFO L225 Difference]: With dead ends: 399 [2024-10-11 07:49:50,777 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 07:49:50,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-11 07:49:50,778 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 180 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:49:50,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 533 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 07:49:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 07:49:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 173. [2024-10-11 07:49:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 07:49:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2024-10-11 07:49:50,796 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 160 [2024-10-11 07:49:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:49:50,796 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2024-10-11 07:49:50,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:49:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2024-10-11 07:49:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 07:49:50,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:49:50,797 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:49:50,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 07:49:50,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:49:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:49:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 710144334, now seen corresponding path program 1 times [2024-10-11 07:49:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:49:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143347571] [2024-10-11 07:49:50,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:49:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:49:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat