./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_variablewrapping_wrapper-sp_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b230d83c95de2b0a2d65b5c62bdacb0eaf62e204b83623e9d22dd193a3762a9e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:09:02,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:09:02,275 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:09:02,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:09:02,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:09:02,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:09:02,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:09:02,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:09:02,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:09:02,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:09:02,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:09:02,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:09:02,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:09:02,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:09:02,332 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:09:02,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:09:02,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:09:02,333 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:09:02,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:09:02,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:09:02,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:09:02,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:09:02,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:09:02,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:09:02,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:09:02,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:09:02,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:09:02,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:09:02,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:09:02,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:09:02,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:09:02,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:09:02,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:09:02,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:09:02,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:09:02,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:09:02,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:09:02,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:09:02,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:09:02,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:09:02,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:09:02,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:09:02,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b230d83c95de2b0a2d65b5c62bdacb0eaf62e204b83623e9d22dd193a3762a9e [2024-10-14 14:09:02,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:09:02,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:09:02,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:09:02,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:09:02,632 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:09:02,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i [2024-10-14 14:09:04,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:09:04,346 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:09:04,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-59.i [2024-10-14 14:09:04,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f36b8ac6/598da457200f41e3a99d09a0e997e1aa/FLAG65cc525f6 [2024-10-14 14:09:04,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f36b8ac6/598da457200f41e3a99d09a0e997e1aa [2024-10-14 14:09:04,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:09:04,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:09:04,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:09:04,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:09:04,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:09:04,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e319300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04, skipping insertion in model container [2024-10-14 14:09:04,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:09:04,576 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_variablewrapping_wrapper-sp_file-59.i[917,930] [2024-10-14 14:09:04,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:09:04,642 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:09:04,655 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_variablewrapping_wrapper-sp_file-59.i[917,930] [2024-10-14 14:09:04,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:09:04,734 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:09:04,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04 WrapperNode [2024-10-14 14:09:04,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:09:04,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:09:04,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:09:04,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:09:04,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,810 INFO L138 Inliner]: procedures = 26, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 356 [2024-10-14 14:09:04,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:09:04,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:09:04,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:09:04,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:09:04,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,860 INFO L175 MemorySlicer]: Split 96 memory accesses to 2 slices as follows [2, 94]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-14 14:09:04,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:09:04,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:09:04,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:09:04,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:09:04,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (1/1) ... [2024-10-14 14:09:04,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:09:04,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:09:04,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:09:04,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:09:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:09:04,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:09:04,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:09:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:09:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:09:05,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:09:05,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:09:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:09:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:09:05,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:09:05,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:09:05,142 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:09:05,146 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:09:05,574 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-14 14:09:05,577 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:09:05,621 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:09:05,621 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:09:05,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:09:05 BoogieIcfgContainer [2024-10-14 14:09:05,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:09:05,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:09:05,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:09:05,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:09:05,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:09:04" (1/3) ... [2024-10-14 14:09:05,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75163d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:09:05, skipping insertion in model container [2024-10-14 14:09:05,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:09:04" (2/3) ... [2024-10-14 14:09:05,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75163d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:09:05, skipping insertion in model container [2024-10-14 14:09:05,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:09:05" (3/3) ... [2024-10-14 14:09:05,632 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-59.i [2024-10-14 14:09:05,652 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:09:05,653 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:09:05,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:09:05,732 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1aae46e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:09:05,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:09:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:09:05,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:09:05,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:05,749 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:05,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:05,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:05,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1520387203, now seen corresponding path program 1 times [2024-10-14 14:09:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418922516] [2024-10-14 14:09:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:06,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:06,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418922516] [2024-10-14 14:09:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418922516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:06,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:06,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:09:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128131056] [2024-10-14 14:09:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:06,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:09:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:06,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:09:06,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:09:06,283 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:06,331 INFO L93 Difference]: Finished difference Result 151 states and 246 transitions. [2024-10-14 14:09:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:09:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2024-10-14 14:09:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:06,347 INFO L225 Difference]: With dead ends: 151 [2024-10-14 14:09:06,347 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 14:09:06,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-14 14:09:06,358 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:06,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:09:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 14:09:06,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-14 14:09:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 14:09:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2024-10-14 14:09:06,400 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 126 [2024-10-14 14:09:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:06,401 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2024-10-14 14:09:06,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2024-10-14 14:09:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 14:09:06,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:06,406 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:06,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:09:06,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:06,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1723858521, now seen corresponding path program 1 times [2024-10-14 14:09:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:06,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079262932] [2024-10-14 14:09:06,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:07,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079262932] [2024-10-14 14:09:07,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079262932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:09:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441849458] [2024-10-14 14:09:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:09:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:07,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:09:07,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:09:07,115 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:07,524 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2024-10-14 14:09:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:09:07,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-14 14:09:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:07,530 INFO L225 Difference]: With dead ends: 224 [2024-10-14 14:09:07,532 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 14:09:07,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:09:07,534 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:07,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 219 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:09:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 14:09:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2024-10-14 14:09:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 102 states have internal predecessors, (135), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions. [2024-10-14 14:09:07,575 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 126 [2024-10-14 14:09:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:07,575 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions. [2024-10-14 14:09:07,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions. [2024-10-14 14:09:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:09:07,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:07,580 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:07,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:09:07,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:07,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:07,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1200500503, now seen corresponding path program 1 times [2024-10-14 14:09:07,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:07,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987675077] [2024-10-14 14:09:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:07,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:07,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987675077] [2024-10-14 14:09:07,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987675077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:07,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:07,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:09:07,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485574945] [2024-10-14 14:09:07,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:07,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:09:07,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:09:07,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:09:07,751 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:07,786 INFO L93 Difference]: Finished difference Result 238 states and 353 transitions. [2024-10-14 14:09:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:09:07,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-10-14 14:09:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:07,788 INFO L225 Difference]: With dead ends: 238 [2024-10-14 14:09:07,788 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 14:09:07,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:09:07,791 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:07,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:09:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 14:09:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-14 14:09:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 104 states have internal predecessors, (137), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2024-10-14 14:09:07,816 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 128 [2024-10-14 14:09:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:07,817 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2024-10-14 14:09:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2024-10-14 14:09:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:09:07,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:07,820 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:07,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:09:07,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1506118891, now seen corresponding path program 1 times [2024-10-14 14:09:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700183094] [2024-10-14 14:09:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700183094] [2024-10-14 14:09:09,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700183094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:09:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032816958] [2024-10-14 14:09:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:09,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:09:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:09,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:09:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:09:09,311 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-14 14:09:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:09,642 INFO L93 Difference]: Finished difference Result 234 states and 344 transitions. [2024-10-14 14:09:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:09:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 128 [2024-10-14 14:09:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:09,645 INFO L225 Difference]: With dead ends: 234 [2024-10-14 14:09:09,645 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 14:09:09,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:09:09,647 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 44 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:09,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 211 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:09:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 14:09:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-14 14:09:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 208 transitions. [2024-10-14 14:09:09,669 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 208 transitions. Word has length 128 [2024-10-14 14:09:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:09,670 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 208 transitions. [2024-10-14 14:09:09,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-14 14:09:09,671 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 208 transitions. [2024-10-14 14:09:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:09:09,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:09,672 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:09,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:09:09,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:09,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1764284329, now seen corresponding path program 1 times [2024-10-14 14:09:09,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:09,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056302258] [2024-10-14 14:09:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:09,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056302258] [2024-10-14 14:09:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056302258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:10,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:10,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:09:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294425858] [2024-10-14 14:09:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:10,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:09:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:09:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:09:10,145 INFO L87 Difference]: Start difference. First operand 143 states and 208 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:10,414 INFO L93 Difference]: Finished difference Result 256 states and 374 transitions. [2024-10-14 14:09:10,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:09:10,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-10-14 14:09:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:10,418 INFO L225 Difference]: With dead ends: 256 [2024-10-14 14:09:10,418 INFO L226 Difference]: Without dead ends: 168 [2024-10-14 14:09:10,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:09:10,422 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 160 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:10,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 154 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:09:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-14 14:09:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2024-10-14 14:09:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2024-10-14 14:09:10,465 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 128 [2024-10-14 14:09:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2024-10-14 14:09:10,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2024-10-14 14:09:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:09:10,470 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:10,470 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:09:10,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:10,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:10,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1850624597, now seen corresponding path program 1 times [2024-10-14 14:09:10,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407781568] [2024-10-14 14:09:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:12,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407781568] [2024-10-14 14:09:12,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407781568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:12,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:12,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:09:12,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423451338] [2024-10-14 14:09:12,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:12,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:09:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:12,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:09:12,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:09:12,258 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:12,770 INFO L93 Difference]: Finished difference Result 275 states and 398 transitions. [2024-10-14 14:09:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:09:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 128 [2024-10-14 14:09:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:12,773 INFO L225 Difference]: With dead ends: 275 [2024-10-14 14:09:12,773 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 14:09:12,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:09:12,775 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 145 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:12,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 241 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:09:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 14:09:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 158. [2024-10-14 14:09:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2024-10-14 14:09:12,810 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 128 [2024-10-14 14:09:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:12,810 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2024-10-14 14:09:12,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:12,811 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2024-10-14 14:09:12,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:09:12,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:12,812 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:12,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:09:12,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:12,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1634996073, now seen corresponding path program 1 times [2024-10-14 14:09:12,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158113686] [2024-10-14 14:09:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:12,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:12,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158113686] [2024-10-14 14:09:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158113686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:12,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:12,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:09:12,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585002932] [2024-10-14 14:09:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:12,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:09:12,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:12,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:09:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:09:12,992 INFO L87 Difference]: Start difference. First operand 158 states and 226 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:13,255 INFO L93 Difference]: Finished difference Result 300 states and 432 transitions. [2024-10-14 14:09:13,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:09:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-10-14 14:09:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:13,257 INFO L225 Difference]: With dead ends: 300 [2024-10-14 14:09:13,257 INFO L226 Difference]: Without dead ends: 203 [2024-10-14 14:09:13,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:09:13,258 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 69 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:13,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 274 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:09:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-14 14:09:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 175. [2024-10-14 14:09:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 136 states have internal predecessors, (176), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2024-10-14 14:09:13,291 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 128 [2024-10-14 14:09:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:13,292 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2024-10-14 14:09:13,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2024-10-14 14:09:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 14:09:13,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:13,295 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:09:13,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1149560019, now seen corresponding path program 1 times [2024-10-14 14:09:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918159481] [2024-10-14 14:09:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918159481] [2024-10-14 14:09:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918159481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:09:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860404710] [2024-10-14 14:09:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:13,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:09:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:09:13,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:09:13,463 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:13,737 INFO L93 Difference]: Finished difference Result 313 states and 447 transitions. [2024-10-14 14:09:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:09:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-10-14 14:09:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:13,739 INFO L225 Difference]: With dead ends: 313 [2024-10-14 14:09:13,739 INFO L226 Difference]: Without dead ends: 196 [2024-10-14 14:09:13,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:09:13,740 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 72 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:13,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 273 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:09:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-14 14:09:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 168. [2024-10-14 14:09:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 238 transitions. [2024-10-14 14:09:13,765 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 238 transitions. Word has length 128 [2024-10-14 14:09:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:13,766 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 238 transitions. [2024-10-14 14:09:13,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 14:09:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 238 transitions. [2024-10-14 14:09:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 14:09:13,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:13,767 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:09:13,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash -310864231, now seen corresponding path program 1 times [2024-10-14 14:09:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705139690] [2024-10-14 14:09:13,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:09:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:09:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:09:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:09:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:09:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:09:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:09:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:09:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 14:09:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 14:09:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:09:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:09:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:09:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:09:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:09:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:09:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 14:09:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 14:09:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 14:09:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705139690] [2024-10-14 14:09:14,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705139690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:09:14,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:09:14,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 14:09:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872624955] [2024-10-14 14:09:14,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:09:14,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 14:09:14,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:14,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 14:09:14,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 14:09:14,444 INFO L87 Difference]: Start difference. First operand 168 states and 238 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:14,895 INFO L93 Difference]: Finished difference Result 341 states and 481 transitions. [2024-10-14 14:09:14,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:09:14,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2024-10-14 14:09:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:14,898 INFO L225 Difference]: With dead ends: 341 [2024-10-14 14:09:14,898 INFO L226 Difference]: Without dead ends: 241 [2024-10-14 14:09:14,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:09:14,901 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 144 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:14,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 332 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:09:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-14 14:09:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 214. [2024-10-14 14:09:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 175 states have internal predecessors, (226), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 298 transitions. [2024-10-14 14:09:14,932 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 298 transitions. Word has length 130 [2024-10-14 14:09:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:14,932 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 298 transitions. [2024-10-14 14:09:14,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 298 transitions. [2024-10-14 14:09:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 14:09:14,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:14,934 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:09:14,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:14,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1250744722, now seen corresponding path program 1 times [2024-10-14 14:09:14,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:14,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068935019] [2024-10-14 14:09:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:09:15,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642899458] [2024-10-14 14:09:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:09:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:09:15,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:09:15,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 14:09:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:15,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-14 14:09:15,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:09:15,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:16,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:16,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:17,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:18,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:18,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:19,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:19,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:20,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-14 14:09:20,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2024-10-14 14:09:20,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:20,874 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 14:09:20,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 58 [2024-10-14 14:09:21,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:21,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 14:09:21,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 33 [2024-10-14 14:09:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-14 14:09:21,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:09:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:09:22,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068935019] [2024-10-14 14:09:22,467 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 14:09:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642899458] [2024-10-14 14:09:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642899458] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:09:22,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 14:09:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-14 14:09:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976676238] [2024-10-14 14:09:22,467 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 14:09:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 14:09:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:09:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 14:09:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-14 14:09:22,469 INFO L87 Difference]: Start difference. First operand 214 states and 298 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:23,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:09:23,451 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2024-10-14 14:09:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 14:09:23,452 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2024-10-14 14:09:23,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:09:23,454 INFO L225 Difference]: With dead ends: 373 [2024-10-14 14:09:23,454 INFO L226 Difference]: Without dead ends: 232 [2024-10-14 14:09:23,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2024-10-14 14:09:23,455 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 14:09:23,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 446 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 14:09:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-14 14:09:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2024-10-14 14:09:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 175 states have internal predecessors, (225), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 14:09:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 297 transitions. [2024-10-14 14:09:23,492 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 297 transitions. Word has length 131 [2024-10-14 14:09:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:09:23,492 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 297 transitions. [2024-10-14 14:09:23,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 14:09:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-10-14 14:09:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 14:09:23,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:09:23,494 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 14:09:23,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 14:09:23,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 14:09:23,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:09:23,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:09:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash 299892084, now seen corresponding path program 1 times [2024-10-14 14:09:23,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:09:23,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870600361] [2024-10-14 14:09:23,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:09:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 14:09:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [610424543] [2024-10-14 14:09:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:09:23,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:09:23,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:09:23,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:09:23,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 14:09:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:09:24,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-14 14:09:24,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:09:24,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2024-10-14 14:09:26,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:26,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:26,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:26,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-14 14:09:27,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:27,059 INFO L349 Elim1Store]: treesize reduction 26, result has 29.7 percent of original size [2024-10-14 14:09:27,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 51 [2024-10-14 14:09:37,629 INFO L349 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2024-10-14 14:09:37,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 162 treesize of output 258