./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.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 c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:45:04,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:45:05,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:45:05,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:45:05,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:45:05,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:45:05,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:45:05,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:45:05,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:45:05,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:45:05,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:45:05,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:45:05,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:45:05,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:45:05,093 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:45:05,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:45:05,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:45:05,094 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:45:05,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:45:05,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:45:05,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:45:05,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:45:05,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:45:05,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:45:05,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:45:05,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:45:05,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:45:05,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:45:05,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:45:05,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:45:05,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:45:05,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:45:05,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:45:05,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:45:05,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:45:05,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:45:05,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:45:05,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:45:05,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:45:05,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:45:05,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:45:05,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:45:05,105 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 -> c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 [2024-10-13 06:45:05,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:45:05,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:45:05,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:45:05,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:45:05,393 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:45:05,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2024-10-13 06:45:06,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:45:07,076 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:45:07,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2024-10-13 06:45:07,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9371e243/94e8741dfd8349aaa5e6022bc14a3efb/FLAG6ac58378f [2024-10-13 06:45:07,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9371e243/94e8741dfd8349aaa5e6022bc14a3efb [2024-10-13 06:45:07,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:45:07,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:45:07,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:45:07,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:45:07,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:45:07,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e32ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07, skipping insertion in model container [2024-10-13 06:45:07,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:45:07,327 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2024-10-13 06:45:07,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:45:07,399 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:45:07,409 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2024-10-13 06:45:07,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:45:07,471 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:45:07,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07 WrapperNode [2024-10-13 06:45:07,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:45:07,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:45:07,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:45:07,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:45:07,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,530 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2024-10-13 06:45:07,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:45:07,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:45:07,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:45:07,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:45:07,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,590 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2024-10-13 06:45:07,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:45:07,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:45:07,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:45:07,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:45:07,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (1/1) ... [2024-10-13 06:45:07,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:45:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:45:07,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:45:07,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:45:07,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:45:07,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:45:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:45:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:45:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:45:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:45:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:45:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:45:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:45:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:45:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:45:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:45:07,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:45:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:45:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:45:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:45:07,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:45:07,905 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:45:07,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:45:08,383 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-13 06:45:08,383 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:45:08,416 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:45:08,416 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:45:08,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:45:08 BoogieIcfgContainer [2024-10-13 06:45:08,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:45:08,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:45:08,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:45:08,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:45:08,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:45:07" (1/3) ... [2024-10-13 06:45:08,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45450962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:45:08, skipping insertion in model container [2024-10-13 06:45:08,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:45:07" (2/3) ... [2024-10-13 06:45:08,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45450962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:45:08, skipping insertion in model container [2024-10-13 06:45:08,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:45:08" (3/3) ... [2024-10-13 06:45:08,430 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-97.i [2024-10-13 06:45:08,443 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:45:08,443 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:45:08,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:45:08,504 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;@70c5840a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:45:08,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:45:08,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:45:08,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:45:08,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:08,524 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:08,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:08,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash -336066129, now seen corresponding path program 1 times [2024-10-13 06:45:08,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:08,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939406077] [2024-10-13 06:45:08,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:08,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:45:08,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939406077] [2024-10-13 06:45:08,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939406077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:45:08,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:45:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:45:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75183649] [2024-10-13 06:45:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:45:08,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:45:08,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:09,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:45:09,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:45:09,020 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:45:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:09,070 INFO L93 Difference]: Finished difference Result 199 states and 315 transitions. [2024-10-13 06:45:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:45:09,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-13 06:45:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:09,082 INFO L225 Difference]: With dead ends: 199 [2024-10-13 06:45:09,083 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 06:45:09,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:45:09,092 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:09,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:45:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 06:45:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 06:45:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:45:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-10-13 06:45:09,164 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 129 [2024-10-13 06:45:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:09,165 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-10-13 06:45:09,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:45:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-10-13 06:45:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 06:45:09,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:09,168 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:09,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:45:09,169 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:09,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -179489779, now seen corresponding path program 1 times [2024-10-13 06:45:09,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768151011] [2024-10-13 06:45:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:45:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768151011] [2024-10-13 06:45:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768151011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:45:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:45:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:45:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682751346] [2024-10-13 06:45:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:45:09,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:45:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:09,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:45:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:09,661 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:09,722 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2024-10-13 06:45:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:45:09,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-13 06:45:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:09,728 INFO L225 Difference]: With dead ends: 199 [2024-10-13 06:45:09,728 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 06:45:09,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:09,731 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:09,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:45:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 06:45:09,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-13 06:45:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:45:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-10-13 06:45:09,749 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 129 [2024-10-13 06:45:09,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:09,751 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-10-13 06:45:09,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-10-13 06:45:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 06:45:09,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:09,754 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:09,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:45:09,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:09,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:09,755 INFO L85 PathProgramCache]: Analyzing trace with hash 849501947, now seen corresponding path program 1 times [2024-10-13 06:45:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:09,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701128606] [2024-10-13 06:45:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,045 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:45:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701128606] [2024-10-13 06:45:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701128606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:45:10,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:45:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:45:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059986152] [2024-10-13 06:45:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:45:10,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:45:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:10,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:45:10,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:10,051 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:10,108 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2024-10-13 06:45:10,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:45:10,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-13 06:45:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:10,117 INFO L225 Difference]: With dead ends: 204 [2024-10-13 06:45:10,117 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:45:10,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:10,122 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:10,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 407 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:45:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:45:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-13 06:45:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:45:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-13 06:45:10,134 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 131 [2024-10-13 06:45:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:10,135 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-13 06:45:10,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-13 06:45:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 06:45:10,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:10,137 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:45:10,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:10,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash 40155321, now seen corresponding path program 1 times [2024-10-13 06:45:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665422271] [2024-10-13 06:45:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:45:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665422271] [2024-10-13 06:45:10,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665422271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:45:10,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:45:10,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:45:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102218664] [2024-10-13 06:45:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:45:10,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:45:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:10,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:45:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:10,353 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:10,398 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2024-10-13 06:45:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:45:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-13 06:45:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:10,401 INFO L225 Difference]: With dead ends: 208 [2024-10-13 06:45:10,401 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 06:45:10,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:10,403 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:10,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:45:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 06:45:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-13 06:45:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:45:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-13 06:45:10,416 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 131 [2024-10-13 06:45:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:10,417 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-13 06:45:10,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-13 06:45:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 06:45:10,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:10,423 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:45:10,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:10,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash 97413623, now seen corresponding path program 1 times [2024-10-13 06:45:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228428502] [2024-10-13 06:45:10,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:45:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228428502] [2024-10-13 06:45:10,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228428502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:45:10,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:45:10,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:45:10,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954262790] [2024-10-13 06:45:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:45:10,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:45:10,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:10,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:45:10,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:10,607 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:10,648 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-13 06:45:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:45:10,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-13 06:45:10,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:10,651 INFO L225 Difference]: With dead ends: 212 [2024-10-13 06:45:10,651 INFO L226 Difference]: Without dead ends: 108 [2024-10-13 06:45:10,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:45:10,656 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:10,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 411 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:45:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-13 06:45:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-13 06:45:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:45:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-13 06:45:10,671 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 131 [2024-10-13 06:45:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:10,671 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-13 06:45:10,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-13 06:45:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 06:45:10,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:10,675 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:10,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:45:10,675 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:10,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash 97473205, now seen corresponding path program 1 times [2024-10-13 06:45:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248563493] [2024-10-13 06:45:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:45:11,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248563493] [2024-10-13 06:45:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248563493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:45:11,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:45:11,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:45:11,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426562299] [2024-10-13 06:45:11,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:45:11,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:45:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:11,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:45:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:45:11,494 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:11,845 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2024-10-13 06:45:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:45:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-13 06:45:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:11,847 INFO L225 Difference]: With dead ends: 254 [2024-10-13 06:45:11,847 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 06:45:11,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:45:11,848 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 309 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:11,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 329 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:45:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 06:45:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 109. [2024-10-13 06:45:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:45:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-10-13 06:45:11,858 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 131 [2024-10-13 06:45:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:11,858 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-10-13 06:45:11,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:45:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-10-13 06:45:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 06:45:11,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:11,860 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:11,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:45:11,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:11,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -288289332, now seen corresponding path program 1 times [2024-10-13 06:45:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627713628] [2024-10-13 06:45:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:11,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:45:14,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:14,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627713628] [2024-10-13 06:45:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627713628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:45:14,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180375533] [2024-10-13 06:45:14,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:14,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:45:14,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:45:14,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:45:14,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 06:45:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:14,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 06:45:14,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:45:17,869 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 15 treesize of output 1 [2024-10-13 06:45:18,712 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 25 treesize of output 13 [2024-10-13 06:45:19,269 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 25 treesize of output 13 [2024-10-13 06:45:19,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:19,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:19,661 INFO L349 Elim1Store]: treesize reduction 78, result has 25.7 percent of original size [2024-10-13 06:45:19,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 39 [2024-10-13 06:45:19,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:19,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:19,717 INFO L349 Elim1Store]: treesize reduction 167, result has 0.6 percent of original size [2024-10-13 06:45:19,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 13 [2024-10-13 06:45:19,851 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 06:45:19,851 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 1 case distinctions, treesize of input 21 treesize of output 24 [2024-10-13 06:45:19,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:19,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:19,937 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 06:45:19,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-10-13 06:45:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 183 proven. 73 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-13 06:45:20,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:45:40,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180375533] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:45:40,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:45:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2024-10-13 06:45:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291679574] [2024-10-13 06:45:40,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:45:40,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 06:45:40,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:40,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 06:45:40,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=864, Unknown=3, NotChecked=0, Total=992 [2024-10-13 06:45:40,992 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 26 states, 23 states have (on average 4.043478260869565) internal successors, (93), 26 states have internal predecessors, (93), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-13 06:45:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:43,183 INFO L93 Difference]: Finished difference Result 331 states and 467 transitions. [2024-10-13 06:45:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 06:45:43,184 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.043478260869565) internal successors, (93), 26 states have internal predecessors, (93), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) Word has length 131 [2024-10-13 06:45:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:43,186 INFO L225 Difference]: With dead ends: 331 [2024-10-13 06:45:43,186 INFO L226 Difference]: Without dead ends: 223 [2024-10-13 06:45:43,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=307, Invalid=1412, Unknown=3, NotChecked=0, Total=1722 [2024-10-13 06:45:43,188 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 568 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:43,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1012 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 06:45:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-13 06:45:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 216. [2024-10-13 06:45:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 175 states have internal predecessors, (227), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 06:45:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 305 transitions. [2024-10-13 06:45:43,222 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 305 transitions. Word has length 131 [2024-10-13 06:45:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:43,223 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 305 transitions. [2024-10-13 06:45:43,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.043478260869565) internal successors, (93), 26 states have internal predecessors, (93), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-13 06:45:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2024-10-13 06:45:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 06:45:43,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:43,225 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:43,245 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-10-13 06:45:43,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:45:43,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2093727666, now seen corresponding path program 1 times [2024-10-13 06:45:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:43,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501757632] [2024-10-13 06:45:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:45:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501757632] [2024-10-13 06:45:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501757632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:45:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036761387] [2024-10-13 06:45:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:44,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:45:44,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:45:44,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 06:45:44,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 06:45:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:45,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 06:45:45,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:45:46,711 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 15 treesize of output 1 [2024-10-13 06:45:47,206 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 25 treesize of output 13 [2024-10-13 06:45:47,578 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 25 treesize of output 13 [2024-10-13 06:45:47,930 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 25 treesize of output 13 [2024-10-13 06:45:48,287 INFO L349 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2024-10-13 06:45:48,288 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 2 case distinctions, treesize of input 36 treesize of output 46 [2024-10-13 06:45:48,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,348 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2024-10-13 06:45:48,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-10-13 06:45:48,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,419 INFO L349 Elim1Store]: treesize reduction 99, result has 22.7 percent of original size [2024-10-13 06:45:48,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 41 [2024-10-13 06:45:48,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:48,459 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2024-10-13 06:45:48,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 06:45:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 79 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-13 06:45:48,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:45:48,585 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_580 Int) (v_ArrVal_581 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (< (mod (+ 255 (select (select (let ((.cse0 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_581) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_579))) (store .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset v_ArrVal_580))) c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset)) 256) 255) (not (= (store (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base) c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_579 c_~WrapperStruct00_var_1_20_Pointer~0.offset)) v_ArrVal_579)))) is different from false [2024-10-13 06:45:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036761387] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:45:48,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:45:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-10-13 06:45:48,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177869526] [2024-10-13 06:45:48,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:45:48,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 06:45:48,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:45:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 06:45:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2024-10-13 06:45:48,603 INFO L87 Difference]: Start difference. First operand 216 states and 305 transitions. Second operand has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-13 06:45:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:45:49,335 INFO L93 Difference]: Finished difference Result 416 states and 583 transitions. [2024-10-13 06:45:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:45:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 131 [2024-10-13 06:45:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:45:49,341 INFO L225 Difference]: With dead ends: 416 [2024-10-13 06:45:49,341 INFO L226 Difference]: Without dead ends: 225 [2024-10-13 06:45:49,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=377, Unknown=1, NotChecked=42, Total=552 [2024-10-13 06:45:49,342 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 199 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:45:49,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 494 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:45:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-13 06:45:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-13 06:45:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 178 states have (on average 1.297752808988764) internal successors, (231), 180 states have internal predecessors, (231), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-13 06:45:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 309 transitions. [2024-10-13 06:45:49,368 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 309 transitions. Word has length 131 [2024-10-13 06:45:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:45:49,368 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 309 transitions. [2024-10-13 06:45:49,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.4375) internal successors, (87), 18 states have internal predecessors, (87), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-13 06:45:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 309 transitions. [2024-10-13 06:45:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 06:45:49,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:45:49,370 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:45:49,387 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-10-13 06:45:49,574 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,SelfDestructingSolverStorable7 [2024-10-13 06:45:49,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:45:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:45:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1246480123, now seen corresponding path program 1 times [2024-10-13 06:45:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:45:49,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209167261] [2024-10-13 06:45:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:45:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:45:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:45:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:45:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:45:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:45:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:45:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:45:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:45:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:45:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:45:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:45:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:45:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:45:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:45:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:45:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:45:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:45:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 06:45:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:45:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209167261] [2024-10-13 06:45:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209167261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:45:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409293948] [2024-10-13 06:45:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:45:51,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:45:51,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:45:51,530 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-10-13 06:45:51,532 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-10-13 06:45:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:45:51,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-13 06:45:51,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:45:53,953 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 15 treesize of output 1 [2024-10-13 06:45:54,666 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 25 treesize of output 13 [2024-10-13 06:45:55,236 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 25 treesize of output 13 [2024-10-13 06:45:55,740 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 25 treesize of output 13 [2024-10-13 06:45:56,202 INFO L349 Elim1Store]: treesize reduction 86, result has 28.9 percent of original size [2024-10-13 06:45:56,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 99 [2024-10-13 06:45:56,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:56,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:56,379 INFO L349 Elim1Store]: treesize reduction 204, result has 21.2 percent of original size [2024-10-13 06:45:56,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 205 treesize of output 306 [2024-10-13 06:45:56,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:56,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:56,454 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-10-13 06:45:56,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 74 treesize of output 101 [2024-10-13 06:45:56,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:56,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:56,594 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-10-13 06:45:56,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 79 [2024-10-13 06:45:57,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,678 INFO L349 Elim1Store]: treesize reduction 154, result has 21.8 percent of original size [2024-10-13 06:45:57,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 205 treesize of output 249 [2024-10-13 06:45:57,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,737 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-10-13 06:45:57,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 38 [2024-10-13 06:45:57,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,840 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-10-13 06:45:57,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 38 [2024-10-13 06:45:57,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:57,892 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-13 06:45:57,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 17 [2024-10-13 06:45:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,621 INFO L349 Elim1Store]: treesize reduction 259, result has 15.9 percent of original size [2024-10-13 06:45:58,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 205 treesize of output 253 [2024-10-13 06:45:58,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-10-13 06:45:58,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:58,970 INFO L349 Elim1Store]: treesize reduction 116, result has 25.2 percent of original size [2024-10-13 06:45:58,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 109 treesize of output 110 [2024-10-13 06:45:59,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:59,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:59,344 INFO L349 Elim1Store]: treesize reduction 349, result has 14.7 percent of original size [2024-10-13 06:45:59,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 319 [2024-10-13 06:45:59,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:59,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:59,393 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2024-10-13 06:45:59,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 78 [2024-10-13 06:45:59,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:59,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:45:59,958 INFO L349 Elim1Store]: treesize reduction 168, result has 6.1 percent of original size [2024-10-13 06:45:59,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 101 [2024-10-13 06:46:00,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:00,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:00,185 INFO L349 Elim1Store]: treesize reduction 210, result has 21.6 percent of original size [2024-10-13 06:46:00,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 237 treesize of output 241 [2024-10-13 06:46:01,591 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 389 treesize of output 314 [2024-10-13 06:46:02,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:02,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:02,195 INFO L349 Elim1Store]: treesize reduction 140, result has 21.8 percent of original size [2024-10-13 06:46:02,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 98 treesize of output 102 [2024-10-13 06:46:02,920 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-13 06:46:02,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 33 treesize of output 11 [2024-10-13 06:46:02,939 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 129 treesize of output 93 [2024-10-13 06:46:02,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,117 INFO L349 Elim1Store]: treesize reduction 286, result has 13.9 percent of original size [2024-10-13 06:46:03,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 214 treesize of output 246 [2024-10-13 06:46:03,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 06:46:03,244 INFO L349 Elim1Store]: treesize reduction 98, result has 4.9 percent of original size [2024-10-13 06:46:03,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 49 [2024-10-13 06:46:03,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,301 INFO L349 Elim1Store]: treesize reduction 93, result has 13.1 percent of original size [2024-10-13 06:46:03,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 56 [2024-10-13 06:46:03,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2024-10-13 06:46:03,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,661 INFO L349 Elim1Store]: treesize reduction 174, result has 23.3 percent of original size [2024-10-13 06:46:03,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 127 treesize of output 198 [2024-10-13 06:46:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,879 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 06:46:03,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2024-10-13 06:46:03,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:03,908 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 06:46:03,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 17 [2024-10-13 06:46:05,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:05,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:05,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:05,214 INFO L349 Elim1Store]: treesize reduction 442, result has 0.2 percent of original size [2024-10-13 06:46:05,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 152 treesize of output 272 [2024-10-13 06:46:05,741 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 06:46:05,742 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 1 case distinctions, treesize of input 21 treesize of output 24 [2024-10-13 06:46:05,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:05,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:46:05,849 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 06:46:05,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-10-13 06:46:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 79 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-13 06:46:05,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:46:06,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base))) (and (forall ((v_ArrVal_703 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (not (= v_ArrVal_703 (store (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse0 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_703 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))) (forall ((v_ArrVal_701 (Array Int Int)) (~WrapperStruct00_var_1_12_Pointer~0.offset Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse2 (let ((.cse3 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_701) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_703))) (store .cse3 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse3 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_705 Int)) (< 0 (mod (select (select (let ((.cse1 (store .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (store .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_705))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (= 0 (mod (select (select .cse2 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256))))))) (forall ((v_ArrVal_703 (Array Int Int)) (~WrapperStruct00_var_1_19_Pointer~0.offset Int) (~WrapperStruct00_var_1_19_Pointer~0.base Int)) (or (forall ((v_ArrVal_701 (Array Int Int)) (~WrapperStruct00_var_1_12_Pointer~0.offset Int) (~WrapperStruct00_var_1_12_Pointer~0.base Int)) (let ((.cse5 (let ((.cse6 (store (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base v_ArrVal_701) c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_703))) (store .cse6 c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select .cse6 c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset (select (select .cse6 ~WrapperStruct00_var_1_12_Pointer~0.base) ~WrapperStruct00_var_1_12_Pointer~0.offset)))))) (or (forall ((v_ArrVal_705 Int)) (< 0 (mod (select (select (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (store .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_705))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256))) (not (= 0 (mod (select (select .cse5 c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset) 256)))))) (not (= v_ArrVal_703 (store (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_18_Pointer~0.base (store .cse0 c_~WrapperStruct00_var_1_18_Pointer~0.offset (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_19_Pointer~0.base) ~WrapperStruct00_var_1_19_Pointer~0.offset))) c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset (select v_ArrVal_703 c_~WrapperStruct00_var_1_20_Pointer~0.offset)))))))) is different from false [2024-10-13 06:46:06,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409293948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:46:06,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:46:06,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-10-13 06:46:06,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907526430] [2024-10-13 06:46:06,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:46:06,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 06:46:06,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:06,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 06:46:06,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=761, Unknown=1, NotChecked=56, Total=930 [2024-10-13 06:46:06,454 INFO L87 Difference]: Start difference. First operand 223 states and 309 transitions. Second operand has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 25 states have internal predecessors, (93), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-13 06:46:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:08,952 INFO L93 Difference]: Finished difference Result 493 states and 682 transitions. [2024-10-13 06:46:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 06:46:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 25 states have internal predecessors, (93), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) Word has length 131 [2024-10-13 06:46:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:08,955 INFO L225 Difference]: With dead ends: 493 [2024-10-13 06:46:08,955 INFO L226 Difference]: Without dead ends: 295 [2024-10-13 06:46:08,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=259, Invalid=1304, Unknown=1, NotChecked=76, Total=1640 [2024-10-13 06:46:08,958 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 655 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2008 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:08,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1317 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2008 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 06:46:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-13 06:46:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 288. [2024-10-13 06:46:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.2974137931034482) internal successors, (301), 235 states have internal predecessors, (301), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 399 transitions. [2024-10-13 06:46:09,000 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 399 transitions. Word has length 131 [2024-10-13 06:46:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:09,000 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 399 transitions. [2024-10-13 06:46:09,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 25 states have internal predecessors, (93), 8 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 6 states have call predecessors, (34), 8 states have call successors, (34) [2024-10-13 06:46:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 399 transitions. [2024-10-13 06:46:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 06:46:09,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:09,002 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:09,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 06:46:09,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 06:46:09,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:09,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:09,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1352265374, now seen corresponding path program 1 times [2024-10-13 06:46:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104521214] [2024-10-13 06:46:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:09,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:09,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104521214] [2024-10-13 06:46:09,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104521214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:09,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:09,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:46:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684406429] [2024-10-13 06:46:09,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:46:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:09,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:46:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:46:09,470 INFO L87 Difference]: Start difference. First operand 288 states and 399 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:09,690 INFO L93 Difference]: Finished difference Result 559 states and 773 transitions. [2024-10-13 06:46:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:46:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-13 06:46:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:09,694 INFO L225 Difference]: With dead ends: 559 [2024-10-13 06:46:09,694 INFO L226 Difference]: Without dead ends: 296 [2024-10-13 06:46:09,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:46:09,695 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 54 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:09,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 561 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:46:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-13 06:46:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 290. [2024-10-13 06:46:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 234 states have (on average 1.294871794871795) internal successors, (303), 237 states have internal predecessors, (303), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 401 transitions. [2024-10-13 06:46:09,730 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 401 transitions. Word has length 132 [2024-10-13 06:46:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:09,730 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 401 transitions. [2024-10-13 06:46:09,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 401 transitions. [2024-10-13 06:46:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 06:46:09,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:09,732 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:09,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:46:09,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:09,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1738027911, now seen corresponding path program 1 times [2024-10-13 06:46:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:09,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555998419] [2024-10-13 06:46:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:10,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555998419] [2024-10-13 06:46:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555998419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:46:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091714832] [2024-10-13 06:46:10,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:46:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:10,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:46:10,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:46:10,422 INFO L87 Difference]: Start difference. First operand 290 states and 401 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:10,853 INFO L93 Difference]: Finished difference Result 553 states and 766 transitions. [2024-10-13 06:46:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:46:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-13 06:46:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:10,856 INFO L225 Difference]: With dead ends: 553 [2024-10-13 06:46:10,856 INFO L226 Difference]: Without dead ends: 288 [2024-10-13 06:46:10,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:46:10,858 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 228 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:10,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 318 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:46:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-13 06:46:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-13 06:46:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.2844827586206897) internal successors, (298), 235 states have internal predecessors, (298), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 396 transitions. [2024-10-13 06:46:10,887 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 396 transitions. Word has length 132 [2024-10-13 06:46:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:10,888 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 396 transitions. [2024-10-13 06:46:10,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 396 transitions. [2024-10-13 06:46:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 06:46:10,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:10,890 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:10,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:46:10,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:10,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash 869009472, now seen corresponding path program 1 times [2024-10-13 06:46:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095168792] [2024-10-13 06:46:10,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095168792] [2024-10-13 06:46:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095168792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:11,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:11,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:46:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934665058] [2024-10-13 06:46:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:11,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:46:11,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:11,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:46:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:46:11,591 INFO L87 Difference]: Start difference. First operand 288 states and 396 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:12,065 INFO L93 Difference]: Finished difference Result 553 states and 759 transitions. [2024-10-13 06:46:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:46:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-13 06:46:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:12,068 INFO L225 Difference]: With dead ends: 553 [2024-10-13 06:46:12,068 INFO L226 Difference]: Without dead ends: 290 [2024-10-13 06:46:12,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:46:12,071 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 144 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:12,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 500 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:46:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-13 06:46:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2024-10-13 06:46:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.2801724137931034) internal successors, (297), 235 states have internal predecessors, (297), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2024-10-13 06:46:12,109 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 133 [2024-10-13 06:46:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2024-10-13 06:46:12,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2024-10-13 06:46:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:46:12,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:12,112 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:12,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:46:12,113 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash -899089241, now seen corresponding path program 1 times [2024-10-13 06:46:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:12,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844989342] [2024-10-13 06:46:12,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:12,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:13,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844989342] [2024-10-13 06:46:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844989342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:13,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:13,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:46:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354028911] [2024-10-13 06:46:13,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:13,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:46:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:13,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:46:13,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:46:13,539 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:46:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:14,246 INFO L93 Difference]: Finished difference Result 701 states and 958 transitions. [2024-10-13 06:46:14,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:46:14,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-13 06:46:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:14,249 INFO L225 Difference]: With dead ends: 701 [2024-10-13 06:46:14,249 INFO L226 Difference]: Without dead ends: 438 [2024-10-13 06:46:14,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:46:14,251 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 417 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:14,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 450 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:46:14,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-13 06:46:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 337. [2024-10-13 06:46:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.2811387900355873) internal successors, (360), 284 states have internal predecessors, (360), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 458 transitions. [2024-10-13 06:46:14,292 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 458 transitions. Word has length 134 [2024-10-13 06:46:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:14,294 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 458 transitions. [2024-10-13 06:46:14,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:46:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 458 transitions. [2024-10-13 06:46:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 06:46:14,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:14,296 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:46:14,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 661277115, now seen corresponding path program 1 times [2024-10-13 06:46:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287415301] [2024-10-13 06:46:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:14,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:14,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287415301] [2024-10-13 06:46:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287415301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:14,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:14,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:46:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433039611] [2024-10-13 06:46:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:14,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:46:14,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:46:14,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:46:14,818 INFO L87 Difference]: Start difference. First operand 337 states and 458 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:15,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:15,160 INFO L93 Difference]: Finished difference Result 631 states and 855 transitions. [2024-10-13 06:46:15,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:46:15,161 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-13 06:46:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:15,163 INFO L225 Difference]: With dead ends: 631 [2024-10-13 06:46:15,163 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 06:46:15,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:46:15,165 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 176 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:15,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 364 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:46:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 06:46:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2024-10-13 06:46:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 261 states have (on average 1.2567049808429118) internal successors, (328), 264 states have internal predecessors, (328), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 426 transitions. [2024-10-13 06:46:15,242 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 426 transitions. Word has length 134 [2024-10-13 06:46:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:15,243 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 426 transitions. [2024-10-13 06:46:15,243 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 426 transitions. [2024-10-13 06:46:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:46:15,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:15,244 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:15,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:46:15,245 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:15,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:15,245 INFO L85 PathProgramCache]: Analyzing trace with hash 707658009, now seen corresponding path program 1 times [2024-10-13 06:46:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969733717] [2024-10-13 06:46:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:15,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969733717] [2024-10-13 06:46:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969733717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:15,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:15,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:46:15,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219224412] [2024-10-13 06:46:15,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:15,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:46:15,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:15,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:46:15,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:46:15,940 INFO L87 Difference]: Start difference. First operand 317 states and 426 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:16,498 INFO L93 Difference]: Finished difference Result 609 states and 818 transitions. [2024-10-13 06:46:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:46:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-13 06:46:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:16,501 INFO L225 Difference]: With dead ends: 609 [2024-10-13 06:46:16,501 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 06:46:16,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:46:16,503 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 192 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:16,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 364 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:46:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 06:46:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-13 06:46:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 261 states have (on average 1.2490421455938698) internal successors, (326), 264 states have internal predecessors, (326), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 424 transitions. [2024-10-13 06:46:16,543 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 424 transitions. Word has length 135 [2024-10-13 06:46:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:16,543 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 424 transitions. [2024-10-13 06:46:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 424 transitions. [2024-10-13 06:46:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:46:16,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:16,546 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:16,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:46:16,547 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1728726363, now seen corresponding path program 1 times [2024-10-13 06:46:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597226129] [2024-10-13 06:46:16,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:16,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:17,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:17,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597226129] [2024-10-13 06:46:17,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597226129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:17,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:17,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:46:17,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853824569] [2024-10-13 06:46:17,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:17,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:46:17,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:17,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:46:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:46:17,910 INFO L87 Difference]: Start difference. First operand 317 states and 424 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:18,901 INFO L93 Difference]: Finished difference Result 665 states and 885 transitions. [2024-10-13 06:46:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:46:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-13 06:46:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:18,905 INFO L225 Difference]: With dead ends: 665 [2024-10-13 06:46:18,905 INFO L226 Difference]: Without dead ends: 373 [2024-10-13 06:46:18,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:46:18,907 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 147 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:18,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 871 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:46:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-13 06:46:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 333. [2024-10-13 06:46:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 277 states have (on average 1.2346570397111913) internal successors, (342), 280 states have internal predecessors, (342), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 440 transitions. [2024-10-13 06:46:18,955 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 440 transitions. Word has length 135 [2024-10-13 06:46:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:18,956 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 440 transitions. [2024-10-13 06:46:18,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 440 transitions. [2024-10-13 06:46:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 06:46:18,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:18,958 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:18,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:46:18,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:18,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash 911077913, now seen corresponding path program 1 times [2024-10-13 06:46:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245806105] [2024-10-13 06:46:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:46:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:46:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:46:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:46:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:46:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:46:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:46:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:46:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:46:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:46:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:46:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:46:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:46:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:46:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:46:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:46:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:46:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:46:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:46:19,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:46:19,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245806105] [2024-10-13 06:46:19,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245806105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:46:19,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:46:19,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:46:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729054536] [2024-10-13 06:46:19,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:46:19,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:46:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:46:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:46:19,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:46:19,427 INFO L87 Difference]: Start difference. First operand 333 states and 440 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:46:19,772 INFO L93 Difference]: Finished difference Result 625 states and 828 transitions. [2024-10-13 06:46:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:46:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-13 06:46:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:46:19,779 INFO L225 Difference]: With dead ends: 625 [2024-10-13 06:46:19,779 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 06:46:19,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:46:19,780 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 94 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:46:19,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:46:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 06:46:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-13 06:46:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 261 states have (on average 1.2337164750957854) internal successors, (322), 264 states have internal predecessors, (322), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:46:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 420 transitions. [2024-10-13 06:46:19,829 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 420 transitions. Word has length 135 [2024-10-13 06:46:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:46:19,830 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 420 transitions. [2024-10-13 06:46:19,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:46:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 420 transitions. [2024-10-13 06:46:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 06:46:19,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:46:19,831 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:46:19,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:46:19,832 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:46:19,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:46:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1373723726, now seen corresponding path program 1 times [2024-10-13 06:46:19,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:46:19,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500593003] [2024-10-13 06:46:19,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:46:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:46:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat