./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.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 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:27:15,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:27:15,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:27:15,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:27:15,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:27:15,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:27:15,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:27:15,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:27:15,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:27:15,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:27:15,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:27:15,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:27:15,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:27:15,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:27:15,479 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:27:15,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:27:15,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:27:15,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:27:15,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:27:15,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:27:15,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:27:15,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:27:15,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:27:15,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:27:15,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:27:15,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:27:15,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:27:15,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:27:15,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:27:15,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:27:15,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:27:15,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:27:15,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:27:15,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:27:15,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:27:15,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:27:15,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:27:15,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:27:15,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:27:15,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:27:15,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:27:15,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:27:15,490 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 -> 6426d30449276f41292d944281f990de88775c0c256461a4ce5af87d5d4d093f [2024-11-09 01:27:15,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:27:15,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:27:15,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:27:15,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:27:15,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:27:15,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2024-11-09 01:27:17,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:27:17,434 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:27:17,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i [2024-11-09 01:27:17,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa0c4727/e7d9811df12146f5872df9a29e49af77/FLAG3bb91281f [2024-11-09 01:27:17,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa0c4727/e7d9811df12146f5872df9a29e49af77 [2024-11-09 01:27:17,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:27:17,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:27:17,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:17,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:27:17,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:27:17,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:17" (1/1) ... [2024-11-09 01:27:17,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cdeba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:17, skipping insertion in model container [2024-11-09 01:27:17,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:27:17" (1/1) ... [2024-11-09 01:27:17,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:27:18,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929] [2024-11-09 01:27:18,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:18,119 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:27:18,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-12.i[916,929] [2024-11-09 01:27:18,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:27:18,204 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:27:18,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18 WrapperNode [2024-11-09 01:27:18,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:27:18,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:18,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:27:18,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:27:18,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,272 INFO L138 Inliner]: procedures = 26, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2024-11-09 01:27:18,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:27:18,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:27:18,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:27:18,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:27:18,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,310 INFO L175 MemorySlicer]: Split 123 memory accesses to 4 slices as follows [2, 38, 12, 71]. 58 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 2, 4]. The 14 writes are split as follows [0, 8, 2, 4]. [2024-11-09 01:27:18,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:27:18,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:27:18,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:27:18,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:27:18,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (1/1) ... [2024-11-09 01:27:18,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:27:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:27:18,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:27:18,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:27:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:27:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 01:27:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 01:27:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 01:27:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 01:27:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 01:27:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 01:27:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 01:27:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 01:27:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:27:18,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:27:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:27:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 01:27:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 01:27:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 01:27:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:27:18,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:27:18,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:27:18,541 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:27:19,024 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-09 01:27:19,024 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:27:19,041 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:27:19,041 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:27:19,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:19 BoogieIcfgContainer [2024-11-09 01:27:19,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:27:19,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:27:19,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:27:19,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:27:19,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:27:17" (1/3) ... [2024-11-09 01:27:19,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3fe6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:19, skipping insertion in model container [2024-11-09 01:27:19,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:27:18" (2/3) ... [2024-11-09 01:27:19,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3fe6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:27:19, skipping insertion in model container [2024-11-09 01:27:19,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:27:19" (3/3) ... [2024-11-09 01:27:19,051 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-12.i [2024-11-09 01:27:19,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:27:19,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:27:19,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:27:19,141 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;@5087a208, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:27:19,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:27:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 80 states have internal predecessors, (110), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:27:19,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:19,154 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:19,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash -571948604, now seen corresponding path program 1 times [2024-11-09 01:27:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353275067] [2024-11-09 01:27:19,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353275067] [2024-11-09 01:27:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353275067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:27:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891490172] [2024-11-09 01:27:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:27:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:27:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:27:19,525 INFO L87 Difference]: Start difference. First operand has 98 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 80 states have internal predecessors, (110), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:19,550 INFO L93 Difference]: Finished difference Result 183 states and 284 transitions. [2024-11-09 01:27:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:27:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2024-11-09 01:27:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:19,587 INFO L225 Difference]: With dead ends: 183 [2024-11-09 01:27:19,587 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 01:27:19,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:27:19,599 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:19,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:27:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 01:27:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 01:27:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2024-11-09 01:27:19,664 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 117 [2024-11-09 01:27:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:19,665 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2024-11-09 01:27:19,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2024-11-09 01:27:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 01:27:19,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:19,672 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:19,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:27:19,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:19,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:19,673 INFO L85 PathProgramCache]: Analyzing trace with hash 760381860, now seen corresponding path program 1 times [2024-11-09 01:27:19,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:19,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272059334] [2024-11-09 01:27:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:19,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,128 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:20,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:20,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272059334] [2024-11-09 01:27:20,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272059334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:20,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:20,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:27:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567596420] [2024-11-09 01:27:20,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:20,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:27:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:27:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:27:20,135 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:20,177 INFO L93 Difference]: Finished difference Result 173 states and 243 transitions. [2024-11-09 01:27:20,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:27:20,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-09 01:27:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:20,180 INFO L225 Difference]: With dead ends: 173 [2024-11-09 01:27:20,181 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 01:27:20,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:27:20,182 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:20,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:27:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 01:27:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 01:27:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-11-09 01:27:20,201 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 117 [2024-11-09 01:27:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:20,204 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-11-09 01:27:20,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-11-09 01:27:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 01:27:20,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:20,207 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:20,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:27:20,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:20,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -124307358, now seen corresponding path program 1 times [2024-11-09 01:27:20,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:20,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588778583] [2024-11-09 01:27:20,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:20,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:20,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588778583] [2024-11-09 01:27:20,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588778583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383750415] [2024-11-09 01:27:20,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:20,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:20,601 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:20,640 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2024-11-09 01:27:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-09 01:27:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:20,646 INFO L225 Difference]: With dead ends: 176 [2024-11-09 01:27:20,646 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 01:27:20,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:20,648 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:20,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:27:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 01:27:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 01:27:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2024-11-09 01:27:20,662 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 119 [2024-11-09 01:27:20,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:20,663 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2024-11-09 01:27:20,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2024-11-09 01:27:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 01:27:20,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:20,666 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:20,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:27:20,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:20,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -233055546, now seen corresponding path program 1 times [2024-11-09 01:27:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:20,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688979486] [2024-11-09 01:27:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:21,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688979486] [2024-11-09 01:27:21,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688979486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:21,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:21,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:27:21,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733250178] [2024-11-09 01:27:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:21,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:27:21,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:27:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:27:21,995 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:22,249 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2024-11-09 01:27:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:27:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2024-11-09 01:27:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:22,252 INFO L225 Difference]: With dead ends: 133 [2024-11-09 01:27:22,252 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 01:27:22,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:27:22,253 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:22,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 767 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:27:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 01:27:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2024-11-09 01:27:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 98 states have internal predecessors, (125), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-11-09 01:27:22,263 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 121 [2024-11-09 01:27:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:22,263 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-11-09 01:27:22,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-11-09 01:27:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 01:27:22,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:22,265 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:27:22,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash 44675301, now seen corresponding path program 1 times [2024-11-09 01:27:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515116985] [2024-11-09 01:27:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:27:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:24,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515116985] [2024-11-09 01:27:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515116985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:24,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608389387] [2024-11-09 01:27:24,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:24,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:24,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:27:24,416 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-11-09 01:27:24,417 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-11-09 01:27:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:24,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 01:27:24,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:24,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 01:27:24,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 01:27:25,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:25,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-09 01:27:25,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:25,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2024-11-09 01:27:25,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:25,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 40 [2024-11-09 01:27:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:27:26,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:27,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-09 01:27:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-09 01:27:27,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608389387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:27,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:27:27,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 23] total 46 [2024-11-09 01:27:27,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354003270] [2024-11-09 01:27:27,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:27,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 01:27:27,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 01:27:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1736, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 01:27:27,199 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 46 states, 36 states have (on average 3.888888888888889) internal successors, (140), 41 states have internal predecessors, (140), 13 states have call successors, (47), 5 states have call predecessors, (47), 10 states have return successors, (47), 8 states have call predecessors, (47), 13 states have call successors, (47) [2024-11-09 01:27:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:28,570 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2024-11-09 01:27:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 01:27:28,571 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 3.888888888888889) internal successors, (140), 41 states have internal predecessors, (140), 13 states have call successors, (47), 5 states have call predecessors, (47), 10 states have return successors, (47), 8 states have call predecessors, (47), 13 states have call successors, (47) Word has length 122 [2024-11-09 01:27:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:28,573 INFO L225 Difference]: With dead ends: 191 [2024-11-09 01:27:28,575 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 01:27:28,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 245 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=725, Invalid=3057, Unknown=0, NotChecked=0, Total=3782 [2024-11-09 01:27:28,577 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 324 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:28,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 2035 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:27:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 01:27:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 132. [2024-11-09 01:27:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 110 states have internal predecessors, (137), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 169 transitions. [2024-11-09 01:27:28,604 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 169 transitions. Word has length 122 [2024-11-09 01:27:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:28,606 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 169 transitions. [2024-11-09 01:27:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 3.888888888888889) internal successors, (140), 41 states have internal predecessors, (140), 13 states have call successors, (47), 5 states have call predecessors, (47), 10 states have return successors, (47), 8 states have call predecessors, (47), 13 states have call successors, (47) [2024-11-09 01:27:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 169 transitions. [2024-11-09 01:27:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 01:27:28,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:28,608 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:28,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:28,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:28,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:28,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 972179707, now seen corresponding path program 1 times [2024-11-09 01:27:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601769581] [2024-11-09 01:27:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-09 01:27:30,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:30,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601769581] [2024-11-09 01:27:30,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601769581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:30,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207606316] [2024-11-09 01:27:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:30,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:30,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:27:30,389 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-11-09 01:27:30,390 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-11-09 01:27:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:30,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 01:27:30,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:30,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 01:27:30,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 01:27:31,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:31,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2024-11-09 01:27:31,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:31,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2024-11-09 01:27:31,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:31,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2024-11-09 01:27:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 01:27:32,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 6 proven. 156 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-11-09 01:27:33,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207606316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:33,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:27:33,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 26] total 53 [2024-11-09 01:27:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915707167] [2024-11-09 01:27:33,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:33,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-09 01:27:33,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-09 01:27:33,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2338, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 01:27:33,146 INFO L87 Difference]: Start difference. First operand 132 states and 169 transitions. Second operand has 53 states, 43 states have (on average 3.441860465116279) internal successors, (148), 48 states have internal predecessors, (148), 13 states have call successors, (47), 5 states have call predecessors, (47), 10 states have return successors, (47), 8 states have call predecessors, (47), 13 states have call successors, (47) [2024-11-09 01:27:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:34,881 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2024-11-09 01:27:34,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 01:27:34,881 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 43 states have (on average 3.441860465116279) internal successors, (148), 48 states have internal predecessors, (148), 13 states have call successors, (47), 5 states have call predecessors, (47), 10 states have return successors, (47), 8 states have call predecessors, (47), 13 states have call successors, (47) Word has length 123 [2024-11-09 01:27:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:34,883 INFO L225 Difference]: With dead ends: 215 [2024-11-09 01:27:34,883 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 01:27:34,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 242 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1787 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1060, Invalid=5420, Unknown=0, NotChecked=0, Total=6480 [2024-11-09 01:27:34,886 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 527 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:34,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1963 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:27:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 01:27:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 134. [2024-11-09 01:27:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.25) internal successors, (140), 112 states have internal predecessors, (140), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2024-11-09 01:27:34,899 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 123 [2024-11-09 01:27:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:34,900 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2024-11-09 01:27:34,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 43 states have (on average 3.441860465116279) internal successors, (148), 48 states have internal predecessors, (148), 13 states have call successors, (47), 5 states have call predecessors, (47), 10 states have return successors, (47), 8 states have call predecessors, (47), 13 states have call successors, (47) [2024-11-09 01:27:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2024-11-09 01:27:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:27:34,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:34,902 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:34,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 01:27:35,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 01:27:35,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:35,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:35,106 INFO L85 PathProgramCache]: Analyzing trace with hash -959553979, now seen corresponding path program 1 times [2024-11-09 01:27:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:35,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35726324] [2024-11-09 01:27:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35726324] [2024-11-09 01:27:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35726324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411771939] [2024-11-09 01:27:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:35,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:35,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:35,279 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:35,347 INFO L93 Difference]: Finished difference Result 347 states and 436 transitions. [2024-11-09 01:27:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:35,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2024-11-09 01:27:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:35,349 INFO L225 Difference]: With dead ends: 347 [2024-11-09 01:27:35,349 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 01:27:35,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:27:35,351 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 54 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:35,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 510 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:27:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 01:27:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-11-09 01:27:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 180 states have (on average 1.2166666666666666) internal successors, (219), 181 states have internal predecessors, (219), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 01:27:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 263 transitions. [2024-11-09 01:27:35,366 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 263 transitions. Word has length 124 [2024-11-09 01:27:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:35,367 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 263 transitions. [2024-11-09 01:27:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 263 transitions. [2024-11-09 01:27:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 01:27:35,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:35,369 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:35,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:27:35,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1108535968, now seen corresponding path program 1 times [2024-11-09 01:27:35,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77272039] [2024-11-09 01:27:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 01:27:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77272039] [2024-11-09 01:27:35,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77272039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437428045] [2024-11-09 01:27:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:35,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:35,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:27:35,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:35,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:27:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:35,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 01:27:35,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:36,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2024-11-09 01:27:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-09 01:27:36,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 01:27:36,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437428045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:36,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:27:36,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-09 01:27:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702709850] [2024-11-09 01:27:36,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:27:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:27:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:27:36,216 INFO L87 Difference]: Start difference. First operand 213 states and 263 transitions. Second operand has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:27:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:36,494 INFO L93 Difference]: Finished difference Result 433 states and 532 transitions. [2024-11-09 01:27:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:27:36,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) Word has length 124 [2024-11-09 01:27:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:36,498 INFO L225 Difference]: With dead ends: 433 [2024-11-09 01:27:36,498 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 01:27:36,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:27:36,502 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 69 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:36,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 386 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:27:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 01:27:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 159. [2024-11-09 01:27:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 136 states have internal predecessors, (166), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2024-11-09 01:27:36,520 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 124 [2024-11-09 01:27:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:36,521 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2024-11-09 01:27:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:27:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2024-11-09 01:27:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 01:27:36,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:36,522 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:36,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:27:36,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:36,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:36,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1994128982, now seen corresponding path program 1 times [2024-11-09 01:27:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:36,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650184186] [2024-11-09 01:27:36,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 01:27:37,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650184186] [2024-11-09 01:27:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650184186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:37,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810871648] [2024-11-09 01:27:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:37,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:27:37,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:37,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:27:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:37,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 01:27:37,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:37,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:37,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-11-09 01:27:37,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:27:37,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 26 [2024-11-09 01:27:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-09 01:27:37,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 01:27:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810871648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:27:37,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:27:37,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-11-09 01:27:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559483834] [2024-11-09 01:27:37,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:37,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:27:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:27:37,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:27:37,753 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand has 12 states, 9 states have (on average 8.0) internal successors, (72), 12 states have internal predecessors, (72), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:27:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:38,101 INFO L93 Difference]: Finished difference Result 367 states and 455 transitions. [2024-11-09 01:27:38,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:27:38,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 8.0) internal successors, (72), 12 states have internal predecessors, (72), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) Word has length 125 [2024-11-09 01:27:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:38,103 INFO L225 Difference]: With dead ends: 367 [2024-11-09 01:27:38,103 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 01:27:38,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-09 01:27:38,104 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 193 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:38,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 463 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:27:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 01:27:38,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 159. [2024-11-09 01:27:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:27:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2024-11-09 01:27:38,125 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 125 [2024-11-09 01:27:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:38,126 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2024-11-09 01:27:38,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 8.0) internal successors, (72), 12 states have internal predecessors, (72), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2024-11-09 01:27:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2024-11-09 01:27:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 01:27:38,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:38,128 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:38,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:27:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:38,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 220271354, now seen corresponding path program 1 times [2024-11-09 01:27:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567046062] [2024-11-09 01:27:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:27:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [515055978] [2024-11-09 01:27:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:27:38,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:38,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:27:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:38,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 01:27:38,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:38,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:38,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:38,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 01:27:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:38,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:38,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:38,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567046062] [2024-11-09 01:27:38,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:27:38,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515055978] [2024-11-09 01:27:38,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515055978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:38,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:38,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:27:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476155526] [2024-11-09 01:27:38,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:38,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:27:38,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:38,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:27:38,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:27:38,978 INFO L87 Difference]: Start difference. First operand 159 states and 197 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:39,079 INFO L93 Difference]: Finished difference Result 417 states and 513 transitions. [2024-11-09 01:27:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:27:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-09 01:27:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:39,082 INFO L225 Difference]: With dead ends: 417 [2024-11-09 01:27:39,082 INFO L226 Difference]: Without dead ends: 261 [2024-11-09 01:27:39,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:39,083 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 48 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:39,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 279 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-09 01:27:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2024-11-09 01:27:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 204 states have (on average 1.1715686274509804) internal successors, (239), 204 states have internal predecessors, (239), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:27:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2024-11-09 01:27:39,105 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 126 [2024-11-09 01:27:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2024-11-09 01:27:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2024-11-09 01:27:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 01:27:39,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:39,108 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:39,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 01:27:39,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 01:27:39,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2052560144, now seen corresponding path program 1 times [2024-11-09 01:27:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830817862] [2024-11-09 01:27:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:27:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1792943055] [2024-11-09 01:27:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:39,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:39,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:27:39,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:27:39,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:27:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:39,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 01:27:39,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:27:39,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 01:27:39,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:27:39,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:27:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:39,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:27:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830817862] [2024-11-09 01:27:39,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:27:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792943055] [2024-11-09 01:27:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792943055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:39,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:39,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:27:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575431584] [2024-11-09 01:27:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:39,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:27:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:27:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:27:39,740 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:39,854 INFO L93 Difference]: Finished difference Result 493 states and 603 transitions. [2024-11-09 01:27:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:27:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-11-09 01:27:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:39,856 INFO L225 Difference]: With dead ends: 493 [2024-11-09 01:27:39,857 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 01:27:39,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:39,858 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 22 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:39,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 277 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 01:27:39,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 240. [2024-11-09 01:27:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 195 states have (on average 1.1641025641025642) internal successors, (227), 195 states have internal predecessors, (227), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:27:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2024-11-09 01:27:39,886 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 127 [2024-11-09 01:27:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:39,887 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2024-11-09 01:27:39,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2024-11-09 01:27:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:39,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:39,888 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:39,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 01:27:40,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:27:40,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:40,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1660078417, now seen corresponding path program 1 times [2024-11-09 01:27:40,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:40,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405031261] [2024-11-09 01:27:40,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:40,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405031261] [2024-11-09 01:27:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405031261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:40,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453890334] [2024-11-09 01:27:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:40,358 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:40,449 INFO L93 Difference]: Finished difference Result 398 states and 489 transitions. [2024-11-09 01:27:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:40,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-09 01:27:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:40,451 INFO L225 Difference]: With dead ends: 398 [2024-11-09 01:27:40,452 INFO L226 Difference]: Without dead ends: 242 [2024-11-09 01:27:40,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:40,453 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:40,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-09 01:27:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-09 01:27:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 197 states have (on average 1.16751269035533) internal successors, (230), 197 states have internal predecessors, (230), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:27:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 294 transitions. [2024-11-09 01:27:40,474 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 294 transitions. Word has length 129 [2024-11-09 01:27:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:40,474 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 294 transitions. [2024-11-09 01:27:40,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 294 transitions. [2024-11-09 01:27:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:40,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:40,476 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:40,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:27:40,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1794091923, now seen corresponding path program 1 times [2024-11-09 01:27:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461809644] [2024-11-09 01:27:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461809644] [2024-11-09 01:27:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461809644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:41,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:27:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340499828] [2024-11-09 01:27:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:41,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:27:41,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:41,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:27:41,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:27:41,205 INFO L87 Difference]: Start difference. First operand 242 states and 294 transitions. Second operand has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:41,576 INFO L93 Difference]: Finished difference Result 564 states and 684 transitions. [2024-11-09 01:27:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:27:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:27:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:41,580 INFO L225 Difference]: With dead ends: 564 [2024-11-09 01:27:41,580 INFO L226 Difference]: Without dead ends: 406 [2024-11-09 01:27:41,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:27:41,582 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 81 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:41,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 597 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:27:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-09 01:27:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 402. [2024-11-09 01:27:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 325 states have (on average 1.1630769230769231) internal successors, (378), 327 states have internal predecessors, (378), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 482 transitions. [2024-11-09 01:27:41,622 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 482 transitions. Word has length 129 [2024-11-09 01:27:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 482 transitions. [2024-11-09 01:27:41,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.666666666666666) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 482 transitions. [2024-11-09 01:27:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:41,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:41,625 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:41,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:27:41,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:41,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1535926485, now seen corresponding path program 1 times [2024-11-09 01:27:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747200994] [2024-11-09 01:27:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747200994] [2024-11-09 01:27:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747200994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:41,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:41,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:27:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938312215] [2024-11-09 01:27:41,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:41,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:27:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:27:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:27:41,951 INFO L87 Difference]: Start difference. First operand 402 states and 482 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:42,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:42,254 INFO L93 Difference]: Finished difference Result 825 states and 995 transitions. [2024-11-09 01:27:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:27:42,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-09 01:27:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:42,258 INFO L225 Difference]: With dead ends: 825 [2024-11-09 01:27:42,259 INFO L226 Difference]: Without dead ends: 552 [2024-11-09 01:27:42,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:42,260 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 65 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:42,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 492 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:27:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-09 01:27:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 402. [2024-11-09 01:27:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 325 states have (on average 1.156923076923077) internal successors, (376), 327 states have internal predecessors, (376), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 480 transitions. [2024-11-09 01:27:42,316 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 480 transitions. Word has length 129 [2024-11-09 01:27:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:42,316 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 480 transitions. [2024-11-09 01:27:42,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 480 transitions. [2024-11-09 01:27:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:42,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:42,318 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:42,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:27:42,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:42,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1928953495, now seen corresponding path program 1 times [2024-11-09 01:27:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:42,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421869812] [2024-11-09 01:27:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:42,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:43,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421869812] [2024-11-09 01:27:43,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421869812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:43,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:43,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:27:43,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169979171] [2024-11-09 01:27:43,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:43,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:27:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:43,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:27:43,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:27:43,230 INFO L87 Difference]: Start difference. First operand 402 states and 480 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:43,741 INFO L93 Difference]: Finished difference Result 786 states and 945 transitions. [2024-11-09 01:27:43,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:27:43,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:27:43,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:43,748 INFO L225 Difference]: With dead ends: 786 [2024-11-09 01:27:43,748 INFO L226 Difference]: Without dead ends: 513 [2024-11-09 01:27:43,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:27:43,749 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 70 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:43,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1021 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:27:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-09 01:27:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 428. [2024-11-09 01:27:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 351 states have (on average 1.1595441595441596) internal successors, (407), 353 states have internal predecessors, (407), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 511 transitions. [2024-11-09 01:27:43,791 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 511 transitions. Word has length 129 [2024-11-09 01:27:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 511 transitions. [2024-11-09 01:27:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 511 transitions. [2024-11-09 01:27:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:43,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:43,793 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:43,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 01:27:43,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:43,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1687390910, now seen corresponding path program 1 times [2024-11-09 01:27:43,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:43,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574181144] [2024-11-09 01:27:43,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:44,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574181144] [2024-11-09 01:27:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574181144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 01:27:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814935669] [2024-11-09 01:27:44,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:44,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:27:44,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:44,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:27:44,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:44,275 INFO L87 Difference]: Start difference. First operand 428 states and 511 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:44,547 INFO L93 Difference]: Finished difference Result 795 states and 953 transitions. [2024-11-09 01:27:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:27:44,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-09 01:27:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:44,551 INFO L225 Difference]: With dead ends: 795 [2024-11-09 01:27:44,551 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 01:27:44,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:27:44,552 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 64 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:44,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 565 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:27:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 01:27:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 428. [2024-11-09 01:27:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 351 states have (on average 1.1538461538461537) internal successors, (405), 353 states have internal predecessors, (405), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 509 transitions. [2024-11-09 01:27:44,615 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 509 transitions. Word has length 129 [2024-11-09 01:27:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 509 transitions. [2024-11-09 01:27:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 509 transitions. [2024-11-09 01:27:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:44,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:44,618 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:44,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 01:27:44,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2080417920, now seen corresponding path program 1 times [2024-11-09 01:27:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699214202] [2024-11-09 01:27:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:46,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699214202] [2024-11-09 01:27:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699214202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:46,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:46,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-09 01:27:46,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227915900] [2024-11-09 01:27:46,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:46,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 01:27:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:46,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 01:27:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-11-09 01:27:46,461 INFO L87 Difference]: Start difference. First operand 428 states and 509 transitions. Second operand has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:27:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:47,752 INFO L93 Difference]: Finished difference Result 812 states and 968 transitions. [2024-11-09 01:27:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 01:27:47,753 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2024-11-09 01:27:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:47,756 INFO L225 Difference]: With dead ends: 812 [2024-11-09 01:27:47,756 INFO L226 Difference]: Without dead ends: 513 [2024-11-09 01:27:47,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2024-11-09 01:27:47,757 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 71 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:47,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 2083 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:27:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-09 01:27:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 434. [2024-11-09 01:27:47,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 357 states have (on average 1.1512605042016806) internal successors, (411), 359 states have internal predecessors, (411), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:47,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 515 transitions. [2024-11-09 01:27:47,805 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 515 transitions. Word has length 129 [2024-11-09 01:27:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:47,805 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 515 transitions. [2024-11-09 01:27:47,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:27:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 515 transitions. [2024-11-09 01:27:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:47,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:47,807 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:47,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 01:27:47,807 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:47,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1300069932, now seen corresponding path program 1 times [2024-11-09 01:27:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513155595] [2024-11-09 01:27:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:47,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513155595] [2024-11-09 01:27:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513155595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:27:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425283955] [2024-11-09 01:27:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:27:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:27:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:27:48,223 INFO L87 Difference]: Start difference. First operand 434 states and 515 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:48,469 INFO L93 Difference]: Finished difference Result 825 states and 983 transitions. [2024-11-09 01:27:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:27:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-09 01:27:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:48,473 INFO L225 Difference]: With dead ends: 825 [2024-11-09 01:27:48,474 INFO L226 Difference]: Without dead ends: 520 [2024-11-09 01:27:48,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:27:48,475 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 89 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:48,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 488 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:27:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-09 01:27:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 434. [2024-11-09 01:27:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 357 states have (on average 1.1484593837535013) internal successors, (410), 359 states have internal predecessors, (410), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 514 transitions. [2024-11-09 01:27:48,521 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 514 transitions. Word has length 129 [2024-11-09 01:27:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:48,522 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 514 transitions. [2024-11-09 01:27:48,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:27:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 514 transitions. [2024-11-09 01:27:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:48,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:48,524 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:48,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 01:27:48,524 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1434083438, now seen corresponding path program 1 times [2024-11-09 01:27:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:48,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742666221] [2024-11-09 01:27:48,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:48,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:49,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742666221] [2024-11-09 01:27:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742666221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:49,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 01:27:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244720166] [2024-11-09 01:27:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:49,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:27:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:27:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:27:49,507 INFO L87 Difference]: Start difference. First operand 434 states and 514 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:50,232 INFO L93 Difference]: Finished difference Result 967 states and 1152 transitions. [2024-11-09 01:27:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:27:50,233 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:27:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:50,237 INFO L225 Difference]: With dead ends: 967 [2024-11-09 01:27:50,237 INFO L226 Difference]: Without dead ends: 662 [2024-11-09 01:27:50,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:27:50,240 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 84 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:50,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1964 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:27:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-09 01:27:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 471. [2024-11-09 01:27:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 394 states have (on average 1.1725888324873097) internal successors, (462), 396 states have internal predecessors, (462), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 566 transitions. [2024-11-09 01:27:50,290 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 566 transitions. Word has length 129 [2024-11-09 01:27:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:50,291 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 566 transitions. [2024-11-09 01:27:50,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 566 transitions. [2024-11-09 01:27:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:50,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:50,292 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:50,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 01:27:50,292 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:50,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:50,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1585547863, now seen corresponding path program 1 times [2024-11-09 01:27:50,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:50,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129929802] [2024-11-09 01:27:50,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:50,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129929802] [2024-11-09 01:27:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129929802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:27:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707344246] [2024-11-09 01:27:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:51,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:27:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:27:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:27:51,240 INFO L87 Difference]: Start difference. First operand 471 states and 566 transitions. Second operand has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:27:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:51,814 INFO L93 Difference]: Finished difference Result 895 states and 1079 transitions. [2024-11-09 01:27:51,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:27:51,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2024-11-09 01:27:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:51,818 INFO L225 Difference]: With dead ends: 895 [2024-11-09 01:27:51,819 INFO L226 Difference]: Without dead ends: 553 [2024-11-09 01:27:51,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:27:51,821 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 71 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:51,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 862 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:27:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-09 01:27:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 473. [2024-11-09 01:27:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 396 states have (on average 1.1717171717171717) internal successors, (464), 398 states have internal predecessors, (464), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 568 transitions. [2024-11-09 01:27:51,872 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 568 transitions. Word has length 129 [2024-11-09 01:27:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:51,872 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 568 transitions. [2024-11-09 01:27:51,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:27:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 568 transitions. [2024-11-09 01:27:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:51,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:51,874 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:51,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 01:27:51,874 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:51,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1722118031, now seen corresponding path program 1 times [2024-11-09 01:27:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:51,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33702129] [2024-11-09 01:27:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:53,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:53,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33702129] [2024-11-09 01:27:53,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33702129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:53,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:53,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 01:27:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869328661] [2024-11-09 01:27:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:27:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:53,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:27:53,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:27:53,079 INFO L87 Difference]: Start difference. First operand 473 states and 568 transitions. Second operand has 12 states, 8 states have (on average 6.5) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-09 01:27:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:53,929 INFO L93 Difference]: Finished difference Result 1019 states and 1228 transitions. [2024-11-09 01:27:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:27:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 6.5) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129 [2024-11-09 01:27:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:53,932 INFO L225 Difference]: With dead ends: 1019 [2024-11-09 01:27:53,932 INFO L226 Difference]: Without dead ends: 675 [2024-11-09 01:27:53,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:27:53,934 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 78 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:53,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 910 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:27:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-09 01:27:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 499. [2024-11-09 01:27:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 422 states have (on average 1.1777251184834123) internal successors, (497), 424 states have internal predecessors, (497), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 01:27:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 601 transitions. [2024-11-09 01:27:54,010 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 601 transitions. Word has length 129 [2024-11-09 01:27:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:54,011 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 601 transitions. [2024-11-09 01:27:54,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 6.5) internal successors, (52), 12 states have internal predecessors, (52), 5 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-09 01:27:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 601 transitions. [2024-11-09 01:27:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:54,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:54,012 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:54,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 01:27:54,013 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:54,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1873582456, now seen corresponding path program 1 times [2024-11-09 01:27:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:54,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832316027] [2024-11-09 01:27:54,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:54,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:54,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832316027] [2024-11-09 01:27:54,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832316027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:54,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:54,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 01:27:54,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830349473] [2024-11-09 01:27:54,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:54,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:27:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:27:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:27:54,806 INFO L87 Difference]: Start difference. First operand 499 states and 601 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:55,583 INFO L93 Difference]: Finished difference Result 1013 states and 1225 transitions. [2024-11-09 01:27:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:27:55,584 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:27:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:55,588 INFO L225 Difference]: With dead ends: 1013 [2024-11-09 01:27:55,588 INFO L226 Difference]: Without dead ends: 643 [2024-11-09 01:27:55,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:27:55,590 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 87 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:55,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 2148 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:27:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-09 01:27:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 628. [2024-11-09 01:27:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 532 states have (on average 1.1766917293233083) internal successors, (626), 535 states have internal predecessors, (626), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:27:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 754 transitions. [2024-11-09 01:27:55,656 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 754 transitions. Word has length 129 [2024-11-09 01:27:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:55,656 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 754 transitions. [2024-11-09 01:27:55,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 754 transitions. [2024-11-09 01:27:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:55,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:55,658 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:55,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 01:27:55,658 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:55,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2028357830, now seen corresponding path program 1 times [2024-11-09 01:27:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:55,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052053075] [2024-11-09 01:27:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052053075] [2024-11-09 01:27:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052053075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:27:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233721835] [2024-11-09 01:27:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:56,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:27:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:56,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:27:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:27:56,447 INFO L87 Difference]: Start difference. First operand 628 states and 754 transitions. Second operand has 10 states, 7 states have (on average 7.428571428571429) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:27:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:56,833 INFO L93 Difference]: Finished difference Result 1274 states and 1528 transitions. [2024-11-09 01:27:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 01:27:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.428571428571429) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2024-11-09 01:27:56,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:56,837 INFO L225 Difference]: With dead ends: 1274 [2024-11-09 01:27:56,837 INFO L226 Difference]: Without dead ends: 771 [2024-11-09 01:27:56,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:27:56,839 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 136 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:56,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 983 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:27:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-09 01:27:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 606. [2024-11-09 01:27:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 510 states have (on average 1.1568627450980393) internal successors, (590), 513 states have internal predecessors, (590), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:27:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 718 transitions. [2024-11-09 01:27:56,955 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 718 transitions. Word has length 129 [2024-11-09 01:27:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:56,956 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 718 transitions. [2024-11-09 01:27:56,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.428571428571429) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:27:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 718 transitions. [2024-11-09 01:27:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:56,958 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:56,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 01:27:56,958 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1856979603, now seen corresponding path program 1 times [2024-11-09 01:27:56,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:56,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059287371] [2024-11-09 01:27:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:56,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:57,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059287371] [2024-11-09 01:27:57,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059287371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:57,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:57,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:27:57,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342909630] [2024-11-09 01:27:57,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:57,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:27:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:27:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:27:57,793 INFO L87 Difference]: Start difference. First operand 606 states and 718 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:58,269 INFO L93 Difference]: Finished difference Result 1142 states and 1356 transitions. [2024-11-09 01:27:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:27:58,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:27:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:58,273 INFO L225 Difference]: With dead ends: 1142 [2024-11-09 01:27:58,274 INFO L226 Difference]: Without dead ends: 665 [2024-11-09 01:27:58,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:27:58,276 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 138 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:58,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 902 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:27:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-09 01:27:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 588. [2024-11-09 01:27:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 492 states have (on average 1.1422764227642277) internal successors, (562), 495 states have internal predecessors, (562), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:27:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 690 transitions. [2024-11-09 01:27:58,365 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 690 transitions. Word has length 129 [2024-11-09 01:27:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:58,366 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 690 transitions. [2024-11-09 01:27:58,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:27:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 690 transitions. [2024-11-09 01:27:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:58,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:58,367 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:58,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 01:27:58,368 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:58,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2007595962, now seen corresponding path program 1 times [2024-11-09 01:27:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982811630] [2024-11-09 01:27:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:58,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:58,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:58,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982811630] [2024-11-09 01:27:58,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982811630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:58,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:27:58,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888501197] [2024-11-09 01:27:58,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:58,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:27:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:58,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:27:58,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:27:58,537 INFO L87 Difference]: Start difference. First operand 588 states and 690 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:27:58,758 INFO L93 Difference]: Finished difference Result 1097 states and 1288 transitions. [2024-11-09 01:27:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:27:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-09 01:27:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:27:58,762 INFO L225 Difference]: With dead ends: 1097 [2024-11-09 01:27:58,762 INFO L226 Difference]: Without dead ends: 638 [2024-11-09 01:27:58,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:27:58,764 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 89 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:27:58,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 579 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:27:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-11-09 01:27:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 561. [2024-11-09 01:27:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 465 states have (on average 1.1376344086021506) internal successors, (529), 468 states have internal predecessors, (529), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:27:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 657 transitions. [2024-11-09 01:27:58,863 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 657 transitions. Word has length 129 [2024-11-09 01:27:58,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:27:58,866 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 657 transitions. [2024-11-09 01:27:58,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:27:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 657 transitions. [2024-11-09 01:27:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:27:58,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:27:58,868 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:27:58,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 01:27:58,869 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:27:58,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:27:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1227247974, now seen corresponding path program 1 times [2024-11-09 01:27:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:27:58,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803103619] [2024-11-09 01:27:58,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:27:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:27:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:27:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:27:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:27:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:27:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:27:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:27:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:27:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:27:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:27:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:27:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:27:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:27:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:27:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:27:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:27:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:27:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:27:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:27:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:27:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803103619] [2024-11-09 01:27:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803103619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:27:59,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:27:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 01:27:59,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385851911] [2024-11-09 01:27:59,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:27:59,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 01:27:59,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:27:59,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 01:27:59,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-09 01:27:59,622 INFO L87 Difference]: Start difference. First operand 561 states and 657 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:28:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:00,358 INFO L93 Difference]: Finished difference Result 1110 states and 1299 transitions. [2024-11-09 01:28:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 01:28:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:28:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:00,362 INFO L225 Difference]: With dead ends: 1110 [2024-11-09 01:28:00,363 INFO L226 Difference]: Without dead ends: 678 [2024-11-09 01:28:00,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:28:00,364 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 86 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:00,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 2079 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:28:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-09 01:28:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 577. [2024-11-09 01:28:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 481 states have (on average 1.137214137214137) internal successors, (547), 484 states have internal predecessors, (547), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:28:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 675 transitions. [2024-11-09 01:28:00,459 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 675 transitions. Word has length 129 [2024-11-09 01:28:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:00,459 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 675 transitions. [2024-11-09 01:28:00,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:28:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 675 transitions. [2024-11-09 01:28:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:28:00,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:00,461 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:00,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 01:28:00,461 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1620274984, now seen corresponding path program 1 times [2024-11-09 01:28:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945792334] [2024-11-09 01:28:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:28:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:28:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:28:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:28:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:28:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:28:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:28:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:28:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:28:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:28:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945792334] [2024-11-09 01:28:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945792334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:28:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167059534] [2024-11-09 01:28:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:28:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:28:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:28:01,102 INFO L87 Difference]: Start difference. First operand 577 states and 675 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:28:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:01,602 INFO L93 Difference]: Finished difference Result 1235 states and 1442 transitions. [2024-11-09 01:28:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:28:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-09 01:28:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:01,606 INFO L225 Difference]: With dead ends: 1235 [2024-11-09 01:28:01,607 INFO L226 Difference]: Without dead ends: 787 [2024-11-09 01:28:01,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:28:01,608 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 142 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:01,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1081 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:28:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-09 01:28:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 575. [2024-11-09 01:28:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 479 states have (on average 1.129436325678497) internal successors, (541), 482 states have internal predecessors, (541), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:28:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 669 transitions. [2024-11-09 01:28:01,699 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 669 transitions. Word has length 129 [2024-11-09 01:28:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:01,700 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 669 transitions. [2024-11-09 01:28:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 01:28:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 669 transitions. [2024-11-09 01:28:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:28:01,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:01,701 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:01,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 01:28:01,701 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:01,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1378712399, now seen corresponding path program 1 times [2024-11-09 01:28:01,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:01,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830115193] [2024-11-09 01:28:01,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:28:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:28:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:28:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:28:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:28:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:28:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:28:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:28:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:28:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:28:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:02,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830115193] [2024-11-09 01:28:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830115193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:28:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170141655] [2024-11-09 01:28:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:02,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:28:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:02,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:28:02,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:28:02,586 INFO L87 Difference]: Start difference. First operand 575 states and 669 transitions. Second operand has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:28:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:03,280 INFO L93 Difference]: Finished difference Result 1152 states and 1340 transitions. [2024-11-09 01:28:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:28:03,281 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2024-11-09 01:28:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:03,284 INFO L225 Difference]: With dead ends: 1152 [2024-11-09 01:28:03,284 INFO L226 Difference]: Without dead ends: 706 [2024-11-09 01:28:03,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:28:03,286 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 107 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:03,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 991 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:28:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-11-09 01:28:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 559. [2024-11-09 01:28:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 463 states have (on average 1.1209503239740821) internal successors, (519), 466 states have internal predecessors, (519), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:28:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 647 transitions. [2024-11-09 01:28:03,395 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 647 transitions. Word has length 129 [2024-11-09 01:28:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:03,395 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 647 transitions. [2024-11-09 01:28:03,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.5) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-09 01:28:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 647 transitions. [2024-11-09 01:28:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 01:28:03,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:03,397 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:03,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 01:28:03,397 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:03,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1361261480, now seen corresponding path program 1 times [2024-11-09 01:28:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513680883] [2024-11-09 01:28:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:28:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:28:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:28:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:28:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:28:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:28:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:28:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:28:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:28:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:28:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:03,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513680883] [2024-11-09 01:28:03,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513680883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:03,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:03,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:03,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770021374] [2024-11-09 01:28:03,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:03,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:03,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:03,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:03,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:03,580 INFO L87 Difference]: Start difference. First operand 559 states and 647 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:03,787 INFO L93 Difference]: Finished difference Result 952 states and 1103 transitions. [2024-11-09 01:28:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:03,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-09 01:28:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:03,790 INFO L225 Difference]: With dead ends: 952 [2024-11-09 01:28:03,790 INFO L226 Difference]: Without dead ends: 522 [2024-11-09 01:28:03,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:03,792 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 86 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:03,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 582 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-09 01:28:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2024-11-09 01:28:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 424 states have (on average 1.1132075471698113) internal successors, (472), 427 states have internal predecessors, (472), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:28:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 600 transitions. [2024-11-09 01:28:03,892 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 600 transitions. Word has length 129 [2024-11-09 01:28:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:03,892 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 600 transitions. [2024-11-09 01:28:03,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 600 transitions. [2024-11-09 01:28:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 01:28:03,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:03,894 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:03,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 01:28:03,894 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:03,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1388191522, now seen corresponding path program 1 times [2024-11-09 01:28:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:03,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796933345] [2024-11-09 01:28:03,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:28:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:28:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:28:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:28:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:28:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:28:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:28:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:28:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:28:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:28:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:03,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796933345] [2024-11-09 01:28:03,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796933345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:03,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:03,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674309919] [2024-11-09 01:28:03,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:03,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:03,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:03,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:03,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:03,981 INFO L87 Difference]: Start difference. First operand 520 states and 600 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:04,103 INFO L93 Difference]: Finished difference Result 913 states and 1055 transitions. [2024-11-09 01:28:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:04,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-09 01:28:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:04,106 INFO L225 Difference]: With dead ends: 913 [2024-11-09 01:28:04,106 INFO L226 Difference]: Without dead ends: 522 [2024-11-09 01:28:04,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:04,108 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 66 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:04,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:28:04,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-09 01:28:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2024-11-09 01:28:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 424 states have (on average 1.0943396226415094) internal successors, (464), 427 states have internal predecessors, (464), 64 states have call successors, (64), 31 states have call predecessors, (64), 31 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 01:28:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 592 transitions. [2024-11-09 01:28:04,215 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 592 transitions. Word has length 131 [2024-11-09 01:28:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:04,215 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 592 transitions. [2024-11-09 01:28:04,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 592 transitions. [2024-11-09 01:28:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:28:04,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:04,217 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:04,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 01:28:04,217 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:04,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1501672288, now seen corresponding path program 1 times [2024-11-09 01:28:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:04,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479287049] [2024-11-09 01:28:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:04,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:28:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:28:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:28:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:28:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:28:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:28:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:28:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:28:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:28:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:28:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 12 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-09 01:28:04,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479287049] [2024-11-09 01:28:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479287049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:04,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296609748] [2024-11-09 01:28:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:04,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:04,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:04,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:04,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:28:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:05,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 01:28:05,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:05,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 01:28:05,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:28:05,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:28:05,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:28:05,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 01:28:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 233 proven. 51 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 01:28:05,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-09 01:28:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296609748] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:06,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:06,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 12] total 29 [2024-11-09 01:28:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755507915] [2024-11-09 01:28:06,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:06,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 01:28:06,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 01:28:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2024-11-09 01:28:06,150 INFO L87 Difference]: Start difference. First operand 520 states and 592 transitions. Second operand has 29 states, 22 states have (on average 4.909090909090909) internal successors, (108), 29 states have internal predecessors, (108), 13 states have call successors, (34), 4 states have call predecessors, (34), 9 states have return successors, (34), 6 states have call predecessors, (34), 13 states have call successors, (34) [2024-11-09 01:28:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:07,253 INFO L93 Difference]: Finished difference Result 923 states and 1041 transitions. [2024-11-09 01:28:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 01:28:07,254 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 4.909090909090909) internal successors, (108), 29 states have internal predecessors, (108), 13 states have call successors, (34), 4 states have call predecessors, (34), 9 states have return successors, (34), 6 states have call predecessors, (34), 13 states have call successors, (34) Word has length 136 [2024-11-09 01:28:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:07,257 INFO L225 Difference]: With dead ends: 923 [2024-11-09 01:28:07,258 INFO L226 Difference]: Without dead ends: 532 [2024-11-09 01:28:07,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 283 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=409, Invalid=1571, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 01:28:07,259 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 176 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:07,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 536 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:28:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-09 01:28:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 315. [2024-11-09 01:28:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 264 states have (on average 1.0909090909090908) internal successors, (288), 264 states have internal predecessors, (288), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 352 transitions. [2024-11-09 01:28:07,360 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 352 transitions. Word has length 136 [2024-11-09 01:28:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:07,361 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 352 transitions. [2024-11-09 01:28:07,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 4.909090909090909) internal successors, (108), 29 states have internal predecessors, (108), 13 states have call successors, (34), 4 states have call predecessors, (34), 9 states have return successors, (34), 6 states have call predecessors, (34), 13 states have call successors, (34) [2024-11-09 01:28:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 352 transitions. [2024-11-09 01:28:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 01:28:07,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:07,362 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:07,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 01:28:07,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:07,563 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:07,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash -916891456, now seen corresponding path program 1 times [2024-11-09 01:28:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:07,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568463811] [2024-11-09 01:28:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:28:07,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425584421] [2024-11-09 01:28:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:07,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:07,640 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:07,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:28:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:08,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 01:28:08,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:08,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:08,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 01:28:08,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:08,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:08,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:08,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:08,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 26 [2024-11-09 01:28:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:08,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:08,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:08,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568463811] [2024-11-09 01:28:08,193 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:28:08,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425584421] [2024-11-09 01:28:08,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425584421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:08,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:08,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:28:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344730858] [2024-11-09 01:28:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:08,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:28:08,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:28:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:28:08,195 INFO L87 Difference]: Start difference. First operand 315 states and 352 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:08,506 INFO L93 Difference]: Finished difference Result 799 states and 885 transitions. [2024-11-09 01:28:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:28:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-09 01:28:08,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:08,508 INFO L225 Difference]: With dead ends: 799 [2024-11-09 01:28:08,508 INFO L226 Difference]: Without dead ends: 487 [2024-11-09 01:28:08,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:08,509 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 59 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:08,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 543 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-09 01:28:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 370. [2024-11-09 01:28:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 319 states have (on average 1.0721003134796239) internal successors, (342), 319 states have internal predecessors, (342), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 406 transitions. [2024-11-09 01:28:08,584 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 406 transitions. Word has length 136 [2024-11-09 01:28:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:08,585 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 406 transitions. [2024-11-09 01:28:08,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 406 transitions. [2024-11-09 01:28:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:28:08,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:08,586 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:08,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:08,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-09 01:28:08,787 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:08,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1279013824, now seen corresponding path program 1 times [2024-11-09 01:28:08,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:08,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800776599] [2024-11-09 01:28:08,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:08,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:28:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481809479] [2024-11-09 01:28:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:08,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:08,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:08,881 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:08,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:28:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:09,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-09 01:28:09,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:09,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 01:28:09,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:09,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 01:28:09,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:09,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2024-11-09 01:28:09,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:09,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 29 [2024-11-09 01:28:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 46 proven. 198 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-09 01:28:10,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800776599] [2024-11-09 01:28:10,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:28:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481809479] [2024-11-09 01:28:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481809479] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:10,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:28:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2024-11-09 01:28:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702765670] [2024-11-09 01:28:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:10,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:28:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:28:10,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-09 01:28:10,586 INFO L87 Difference]: Start difference. First operand 370 states and 406 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:11,176 INFO L93 Difference]: Finished difference Result 853 states and 934 transitions. [2024-11-09 01:28:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:28:11,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-09 01:28:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:11,179 INFO L225 Difference]: With dead ends: 853 [2024-11-09 01:28:11,179 INFO L226 Difference]: Without dead ends: 590 [2024-11-09 01:28:11,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2024-11-09 01:28:11,180 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 265 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:11,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 441 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:28:11,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-09 01:28:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 376. [2024-11-09 01:28:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 325 states have (on average 1.0707692307692307) internal successors, (348), 325 states have internal predecessors, (348), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 412 transitions. [2024-11-09 01:28:11,262 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 412 transitions. Word has length 137 [2024-11-09 01:28:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:11,262 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 412 transitions. [2024-11-09 01:28:11,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 412 transitions. [2024-11-09 01:28:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:28:11,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:11,263 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:11,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 01:28:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:11,464 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:11,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash -466731722, now seen corresponding path program 1 times [2024-11-09 01:28:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616437233] [2024-11-09 01:28:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:28:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:28:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:28:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:28:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:28:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:28:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:28:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:28:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:28:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:28:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-09 01:28:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616437233] [2024-11-09 01:28:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616437233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017586073] [2024-11-09 01:28:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:12,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:12,119 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:12,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:28:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:12,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 01:28:12,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:12,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:28:12,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:12,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 01:28:12,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:12,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2024-11-09 01:28:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:28:12,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2024-11-09 01:28:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017586073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:28:12,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2024-11-09 01:28:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037877385] [2024-11-09 01:28:12,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:28:12,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 01:28:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 01:28:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-11-09 01:28:12,978 INFO L87 Difference]: Start difference. First operand 376 states and 412 transitions. Second operand has 26 states, 20 states have (on average 5.1) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 9 states have call successors, (21) [2024-11-09 01:28:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:13,782 INFO L93 Difference]: Finished difference Result 622 states and 679 transitions. [2024-11-09 01:28:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 01:28:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 20 states have (on average 5.1) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 9 states have call successors, (21) Word has length 137 [2024-11-09 01:28:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:13,785 INFO L225 Difference]: With dead ends: 622 [2024-11-09 01:28:13,785 INFO L226 Difference]: Without dead ends: 353 [2024-11-09 01:28:13,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=1084, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 01:28:13,787 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 565 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:13,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 779 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:28:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-09 01:28:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 341. [2024-11-09 01:28:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 288 states have (on average 1.0659722222222223) internal successors, (307), 288 states have internal predecessors, (307), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 371 transitions. [2024-11-09 01:28:13,868 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 371 transitions. Word has length 137 [2024-11-09 01:28:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:13,868 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 371 transitions. [2024-11-09 01:28:13,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 20 states have (on average 5.1) internal successors, (102), 25 states have internal predecessors, (102), 9 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 9 states have call successors, (21) [2024-11-09 01:28:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 371 transitions. [2024-11-09 01:28:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 01:28:13,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:13,869 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:13,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 01:28:14,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-09 01:28:14,074 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:14,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -792964280, now seen corresponding path program 1 times [2024-11-09 01:28:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547063321] [2024-11-09 01:28:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:28:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203935353] [2024-11-09 01:28:14,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:14,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:14,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:14,159 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:14,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 01:28:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:14,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 01:28:14,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:14,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:14,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:14,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:14,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:14,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 35 [2024-11-09 01:28:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:14,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547063321] [2024-11-09 01:28:14,541 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:28:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203935353] [2024-11-09 01:28:14,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203935353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:14,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:14,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:14,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903991016] [2024-11-09 01:28:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:14,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:14,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:14,542 INFO L87 Difference]: Start difference. First operand 341 states and 371 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:14,855 INFO L93 Difference]: Finished difference Result 648 states and 706 transitions. [2024-11-09 01:28:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:14,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-09 01:28:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:14,857 INFO L225 Difference]: With dead ends: 648 [2024-11-09 01:28:14,857 INFO L226 Difference]: Without dead ends: 418 [2024-11-09 01:28:14,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:14,858 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 45 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:14,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 518 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-09 01:28:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 359. [2024-11-09 01:28:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 306 states have (on average 1.065359477124183) internal successors, (326), 306 states have internal predecessors, (326), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 390 transitions. [2024-11-09 01:28:14,940 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 390 transitions. Word has length 137 [2024-11-09 01:28:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:14,941 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 390 transitions. [2024-11-09 01:28:14,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 390 transitions. [2024-11-09 01:28:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:28:14,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:14,942 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:14,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 01:28:15,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 01:28:15,144 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:15,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash 935866485, now seen corresponding path program 1 times [2024-11-09 01:28:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485433775] [2024-11-09 01:28:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:28:15,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184519824] [2024-11-09 01:28:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:15,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:15,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:15,254 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:15,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 01:28:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:15,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 01:28:15,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:15,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:15,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 10 [2024-11-09 01:28:15,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:15,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:15,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:15,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 01:28:15,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:15,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 37 [2024-11-09 01:28:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:16,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485433775] [2024-11-09 01:28:16,144 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:28:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184519824] [2024-11-09 01:28:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184519824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:16,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:28:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590250267] [2024-11-09 01:28:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:16,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:28:16,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:28:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:28:16,146 INFO L87 Difference]: Start difference. First operand 359 states and 390 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:16,863 INFO L93 Difference]: Finished difference Result 738 states and 803 transitions. [2024-11-09 01:28:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:28:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-09 01:28:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:16,866 INFO L225 Difference]: With dead ends: 738 [2024-11-09 01:28:16,866 INFO L226 Difference]: Without dead ends: 490 [2024-11-09 01:28:16,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:28:16,867 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 122 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:16,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1036 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:28:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-09 01:28:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 364. [2024-11-09 01:28:16,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 311 states have (on average 1.0643086816720257) internal successors, (331), 311 states have internal predecessors, (331), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 395 transitions. [2024-11-09 01:28:16,946 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 395 transitions. Word has length 138 [2024-11-09 01:28:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:16,946 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 395 transitions. [2024-11-09 01:28:16,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 395 transitions. [2024-11-09 01:28:16,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:28:16,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:16,947 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:16,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:17,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 01:28:17,148 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:17,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash 271925311, now seen corresponding path program 1 times [2024-11-09 01:28:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:17,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691695649] [2024-11-09 01:28:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:28:17,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180092857] [2024-11-09 01:28:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:17,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:17,251 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:17,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 01:28:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:17,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:28:17,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:17,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 01:28:17,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:17,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:17,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:17,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:17,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 28 [2024-11-09 01:28:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:17,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:28:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691695649] [2024-11-09 01:28:17,696 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:28:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180092857] [2024-11-09 01:28:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180092857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:17,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:17,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:28:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587356900] [2024-11-09 01:28:17,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:17,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:28:17,699 INFO L87 Difference]: Start difference. First operand 364 states and 395 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:18,013 INFO L93 Difference]: Finished difference Result 724 states and 786 transitions. [2024-11-09 01:28:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:18,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-09 01:28:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:18,016 INFO L225 Difference]: With dead ends: 724 [2024-11-09 01:28:18,016 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 01:28:18,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:28:18,016 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 50 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:18,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 466 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:28:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 01:28:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 358. [2024-11-09 01:28:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 305 states have (on average 1.0655737704918034) internal successors, (325), 305 states have internal predecessors, (325), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 389 transitions. [2024-11-09 01:28:18,102 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 389 transitions. Word has length 138 [2024-11-09 01:28:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:18,102 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 389 transitions. [2024-11-09 01:28:18,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 389 transitions. [2024-11-09 01:28:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 01:28:18,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:18,104 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:18,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 01:28:18,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 01:28:18,305 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:18,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:18,305 INFO L85 PathProgramCache]: Analyzing trace with hash -410523147, now seen corresponding path program 1 times [2024-11-09 01:28:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89324520] [2024-11-09 01:28:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:18,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 01:28:18,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [57942417] [2024-11-09 01:28:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:18,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:18,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:28:18,372 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:28:18,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 01:28:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:18,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 01:28:18,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:28:18,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 01:28:18,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 01:28:18,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-09 01:28:19,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:19,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44 [2024-11-09 01:28:19,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:28:19,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 43 [2024-11-09 01:28:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 149 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-09 01:28:19,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:28:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:19,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89324520] [2024-11-09 01:28:19,821 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 01:28:19,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57942417] [2024-11-09 01:28:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57942417] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 01:28:19,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:28:19,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2024-11-09 01:28:19,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684859107] [2024-11-09 01:28:19,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:19,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:28:19,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:19,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:28:19,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-11-09 01:28:19,822 INFO L87 Difference]: Start difference. First operand 358 states and 389 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:20,092 INFO L93 Difference]: Finished difference Result 663 states and 721 transitions. [2024-11-09 01:28:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:28:20,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-11-09 01:28:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:20,095 INFO L225 Difference]: With dead ends: 663 [2024-11-09 01:28:20,095 INFO L226 Difference]: Without dead ends: 395 [2024-11-09 01:28:20,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:28:20,096 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 123 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:20,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 455 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:28:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-09 01:28:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 332. [2024-11-09 01:28:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 279 states have (on average 1.060931899641577) internal successors, (296), 279 states have internal predecessors, (296), 32 states have call successors, (32), 20 states have call predecessors, (32), 20 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-09 01:28:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 360 transitions. [2024-11-09 01:28:20,169 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 360 transitions. Word has length 138 [2024-11-09 01:28:20,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:20,170 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 360 transitions. [2024-11-09 01:28:20,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:28:20,170 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 360 transitions. [2024-11-09 01:28:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 01:28:20,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:20,171 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:20,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 01:28:20,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:28:20,372 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:28:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1134112650, now seen corresponding path program 1 times [2024-11-09 01:28:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:28:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176620164] [2024-11-09 01:28:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:28:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 01:28:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 01:28:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 01:28:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 01:28:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 01:28:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 01:28:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 01:28:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 01:28:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 01:28:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:28:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:28:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:28:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:28:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 01:28:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 01:28:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:28:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:28:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:28:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176620164] [2024-11-09 01:28:21,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176620164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:21,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:28:21,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 01:28:21,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612300145] [2024-11-09 01:28:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 01:28:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:28:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 01:28:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:28:21,524 INFO L87 Difference]: Start difference. First operand 332 states and 360 transitions. Second operand has 14 states, 13 states have (on average 5.0) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)