/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/array-fpi/res2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 19:58:52,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 19:58:52,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 19:58:52,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 19:58:52,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 19:58:52,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 19:58:52,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 19:58:52,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 19:58:52,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 19:58:52,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 19:58:52,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 19:58:52,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 19:58:52,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 19:58:52,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 19:58:52,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 19:58:52,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 19:58:52,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 19:58:52,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 19:58:52,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 19:58:52,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 19:58:52,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 19:58:52,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 19:58:52,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 19:58:52,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 19:58:52,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 19:58:52,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 19:58:52,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 19:58:52,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 19:58:52,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 19:58:52,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 19:58:52,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 19:58:52,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 19:58:52,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 19:58:52,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 19:58:52,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 19:58:52,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 19:58:52,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 19:58:52,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 19:58:52,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 19:58:52,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 19:58:52,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 19:58:52,327 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-01 19:58:52,361 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 19:58:52,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 19:58:52,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 19:58:52,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 19:58:52,362 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 19:58:52,362 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 19:58:52,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 19:58:52,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 19:58:52,363 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 19:58:52,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 19:58:52,363 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 19:58:52,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 19:58:52,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 19:58:52,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 19:58:52,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 19:58:52,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 19:58:52,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 19:58:52,364 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 19:58:52,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 19:58:52,365 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 19:58:52,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 19:58:52,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 19:58:52,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 19:58:52,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 19:58:52,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 19:58:52,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 19:58:52,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 19:58:52,367 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 19:58:52,367 INFO L138 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 [2023-04-01 19:58:52,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 19:58:52,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 19:58:52,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 19:58:52,566 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 19:58:52,567 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 19:58:52,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2.c [2023-04-01 19:58:53,851 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 19:58:54,011 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 19:58:54,011 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c [2023-04-01 19:58:54,016 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfc42b2b/bb38d24c49d44813bbedd713d8f9bae5/FLAG0950a220f [2023-04-01 19:58:54,029 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfc42b2b/bb38d24c49d44813bbedd713d8f9bae5 [2023-04-01 19:58:54,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 19:58:54,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 19:58:54,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 19:58:54,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 19:58:54,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 19:58:54,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d15db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54, skipping insertion in model container [2023-04-01 19:58:54,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 19:58:54,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 19:58:54,162 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c[587,600] [2023-04-01 19:58:54,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 19:58:54,208 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 19:58:54,221 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2.c[587,600] [2023-04-01 19:58:54,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 19:58:54,239 INFO L208 MainTranslator]: Completed translation [2023-04-01 19:58:54,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54 WrapperNode [2023-04-01 19:58:54,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 19:58:54,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 19:58:54,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 19:58:54,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 19:58:54,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,270 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 19:58:54,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 19:58:54,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 19:58:54,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 19:58:54,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (1/1) ... [2023-04-01 19:58:54,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 19:58:54,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:58:54,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 19:58:54,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 19:58:54,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 19:58:54,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 19:58:54,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 19:58:54,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 19:58:54,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 19:58:54,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 19:58:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 19:58:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 19:58:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 19:58:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 19:58:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 19:58:54,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 19:58:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 19:58:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 19:58:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 19:58:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 19:58:54,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 19:58:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 19:58:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 19:58:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 19:58:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 19:58:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 19:58:54,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 19:58:54,417 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 19:58:54,418 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 19:58:54,591 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 19:58:54,596 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 19:58:54,597 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-04-01 19:58:54,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 07:58:54 BoogieIcfgContainer [2023-04-01 19:58:54,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 19:58:54,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 19:58:54,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 19:58:54,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 19:58:54,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 07:58:54" (1/3) ... [2023-04-01 19:58:54,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10196d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 07:58:54, skipping insertion in model container [2023-04-01 19:58:54,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 07:58:54" (2/3) ... [2023-04-01 19:58:54,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10196d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 07:58:54, skipping insertion in model container [2023-04-01 19:58:54,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 07:58:54" (3/3) ... [2023-04-01 19:58:54,606 INFO L112 eAbstractionObserver]: Analyzing ICFG res2.c [2023-04-01 19:58:54,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 19:58:54,623 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 19:58:54,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 19:58:54,720 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4ccdd282, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 19:58:54,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 19:58:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 19:58:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 19:58:54,731 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:58:54,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:58:54,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:58:54,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:58:54,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1259377407, now seen corresponding path program 1 times [2023-04-01 19:58:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:58:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192592401] [2023-04-01 19:58:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:58:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:58:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:58:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:58:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:58:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:58:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192592401] [2023-04-01 19:58:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192592401] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 19:58:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 19:58:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 19:58:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843328478] [2023-04-01 19:58:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 19:58:55,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 19:58:55,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:58:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 19:58:55,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 19:58:55,097 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:58:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:58:55,187 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2023-04-01 19:58:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 19:58:55,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-04-01 19:58:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:58:55,194 INFO L225 Difference]: With dead ends: 76 [2023-04-01 19:58:55,195 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 19:58:55,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 19:58:55,200 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:58:55,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:58:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 19:58:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 19:58:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:58:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-04-01 19:58:55,230 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2023-04-01 19:58:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:58:55,230 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-04-01 19:58:55,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:58:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-04-01 19:58:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 19:58:55,231 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:58:55,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:58:55,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 19:58:55,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:58:55,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:58:55,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1596973367, now seen corresponding path program 1 times [2023-04-01 19:58:55,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:58:55,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654164289] [2023-04-01 19:58:55,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:58:55,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:58:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:55,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:58:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:58:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:58:55,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:58:55,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654164289] [2023-04-01 19:58:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654164289] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 19:58:55,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 19:58:55,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 19:58:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164704337] [2023-04-01 19:58:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 19:58:55,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 19:58:55,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:58:55,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 19:58:55,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-04-01 19:58:55,408 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:58:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:58:55,552 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2023-04-01 19:58:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 19:58:55,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-04-01 19:58:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:58:55,554 INFO L225 Difference]: With dead ends: 69 [2023-04-01 19:58:55,554 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 19:58:55,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-04-01 19:58:55,556 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 19:58:55,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 25 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 19:58:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 19:58:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2023-04-01 19:58:55,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:58:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2023-04-01 19:58:55,572 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2023-04-01 19:58:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:58:55,572 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2023-04-01 19:58:55,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:58:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2023-04-01 19:58:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-04-01 19:58:55,574 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:58:55,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:58:55,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 19:58:55,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:58:55,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:58:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash 378806037, now seen corresponding path program 1 times [2023-04-01 19:58:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:58:55,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635331] [2023-04-01 19:58:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:58:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:58:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:58:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:57,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:58:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:58:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:58:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635331] [2023-04-01 19:58:57,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635331] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:58:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025368339] [2023-04-01 19:58:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:58:57,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:58:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:58:57,452 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) [2023-04-01 19:58:57,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 19:58:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:58:57,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 66 conjunts are in the unsatisfiable core [2023-04-01 19:58:57,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:58:57,755 INFO L350 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 11 treesize of output 7 [2023-04-01 19:58:57,780 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:58:57,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2023-04-01 19:58:57,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:58:57,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-04-01 19:58:58,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:58:58,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-04-01 19:58:58,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:58:58,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-04-01 19:58:58,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:58:58,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2023-04-01 19:58:59,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:58:59,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2023-04-01 19:58:59,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:58:59,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2023-04-01 19:58:59,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 19:58:59,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2023-04-01 19:58:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:58:59,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:32,934 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 19:59:32,935 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 19:59:32,937 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 19:59:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:59:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025368339] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:42,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 52 [2023-04-01 19:59:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67509871] [2023-04-01 19:59:42,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:42,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-04-01 19:59:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-04-01 19:59:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=2260, Unknown=15, NotChecked=0, Total=2652 [2023-04-01 19:59:42,397 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 states have internal predecessors, (93), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 19:59:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:47,522 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2023-04-01 19:59:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-01 19:59:47,523 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 states have internal predecessors, (93), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2023-04-01 19:59:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:47,524 INFO L225 Difference]: With dead ends: 69 [2023-04-01 19:59:47,524 INFO L226 Difference]: Without dead ends: 63 [2023-04-01 19:59:47,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=674, Invalid=4141, Unknown=15, NotChecked=0, Total=4830 [2023-04-01 19:59:47,527 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:47,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 189 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-01 19:59:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-01 19:59:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2023-04-01 19:59:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-04-01 19:59:47,537 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 41 [2023-04-01 19:59:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:47,538 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-04-01 19:59:47,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 48 states have internal predecessors, (93), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 19:59:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-04-01 19:59:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-01 19:59:47,539 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:47,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:47,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:47,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:47,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:47,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1970902185, now seen corresponding path program 2 times [2023-04-01 19:59:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493983211] [2023-04-01 19:59:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:47,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 19:59:47,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:47,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493983211] [2023-04-01 19:59:47,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493983211] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229815766] [2023-04-01 19:59:47,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 19:59:47,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:47,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:47,891 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) [2023-04-01 19:59:47,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 19:59:47,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 19:59:47,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:47,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 19:59:47,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 19:59:48,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 19:59:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229815766] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:48,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:48,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-04-01 19:59:48,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385647779] [2023-04-01 19:59:48,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:48,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 19:59:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:48,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 19:59:48,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-01 19:59:48,155 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:48,479 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2023-04-01 19:59:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 19:59:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2023-04-01 19:59:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:48,482 INFO L225 Difference]: With dead ends: 140 [2023-04-01 19:59:48,482 INFO L226 Difference]: Without dead ends: 82 [2023-04-01 19:59:48,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-04-01 19:59:48,483 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:48,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 58 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 19:59:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-04-01 19:59:48,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2023-04-01 19:59:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-04-01 19:59:48,494 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 43 [2023-04-01 19:59:48,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:48,495 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-04-01 19:59:48,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 11 states have internal predecessors, (48), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-04-01 19:59:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-04-01 19:59:48,496 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:48,496 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:48,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 19:59:48,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 19:59:48,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:48,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1791240999, now seen corresponding path program 3 times [2023-04-01 19:59:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:48,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137628929] [2023-04-01 19:59:48,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 19:59:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137628929] [2023-04-01 19:59:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137628929] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417690318] [2023-04-01 19:59:48,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 19:59:48,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:48,829 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) [2023-04-01 19:59:48,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 19:59:48,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 19:59:48,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:48,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 19:59:48,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 19:59:48,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 19:59:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 19:59:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417690318] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 19:59:49,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 19:59:49,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-04-01 19:59:49,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569361359] [2023-04-01 19:59:49,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 19:59:49,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 19:59:49,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 19:59:49,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 19:59:49,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-04-01 19:59:49,055 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 19:59:49,335 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-04-01 19:59:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 19:59:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-04-01 19:59:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 19:59:49,336 INFO L225 Difference]: With dead ends: 77 [2023-04-01 19:59:49,336 INFO L226 Difference]: Without dead ends: 59 [2023-04-01 19:59:49,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-04-01 19:59:49,337 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 19:59:49,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 68 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 19:59:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-04-01 19:59:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2023-04-01 19:59:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 19:59:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-04-01 19:59:49,345 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 45 [2023-04-01 19:59:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 19:59:49,345 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-04-01 19:59:49,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 19:59:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-04-01 19:59:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-01 19:59:49,346 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 19:59:49,347 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 19:59:49,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 19:59:49,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:49,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 19:59:49,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 19:59:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1298349409, now seen corresponding path program 4 times [2023-04-01 19:59:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 19:59:49,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873215342] [2023-04-01 19:59:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 19:59:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 19:59:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 19:59:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:52,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-04-01 19:59:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 19:59:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:59:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 19:59:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873215342] [2023-04-01 19:59:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873215342] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 19:59:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738734705] [2023-04-01 19:59:52,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 19:59:52,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 19:59:52,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 19:59:52,761 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 19:59:52,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 19:59:52,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 19:59:52,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 19:59:52,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 105 conjunts are in the unsatisfiable core [2023-04-01 19:59:52,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 19:59:52,912 INFO L350 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 11 treesize of output 7 [2023-04-01 19:59:52,939 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-04-01 19:59:52,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2023-04-01 19:59:53,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-04-01 19:59:53,206 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:59:53,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-04-01 19:59:53,612 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2023-04-01 19:59:53,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 35 [2023-04-01 19:59:53,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-04-01 19:59:54,271 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-04-01 19:59:54,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2023-04-01 19:59:54,492 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-04-01 19:59:54,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2023-04-01 19:59:54,819 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-04-01 19:59:54,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2023-04-01 19:59:55,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-04-01 19:59:55,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2023-04-01 19:59:55,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 71 [2023-04-01 19:59:56,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2023-04-01 19:59:56,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2023-04-01 19:59:57,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 30 [2023-04-01 19:59:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 19:59:57,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 20:02:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 20:02:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738734705] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 20:02:02,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 20:02:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33, 33] total 95 [2023-04-01 20:02:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911411901] [2023-04-01 20:02:02,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 20:02:02,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2023-04-01 20:02:02,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 20:02:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2023-04-01 20:02:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=973, Invalid=7909, Unknown=48, NotChecked=0, Total=8930 [2023-04-01 20:02:02,933 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 95 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 92 states have internal predecessors, (121), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 20:02:23,569 WARN L223 SmtUtils]: Spent 17.45s on a formula simplification. DAG size of input: 235 DAG size of output: 234 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:02:25,711 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse73 (* c_main_~i~0 4))) (let ((.cse13 (select |c_#memory_int| c_main_~a~0.base)) (.cse74 (+ .cse73 c_main_~a~0.offset)) (.cse12 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse0 (select .cse12 |c_main_~#sum~0.offset|)) (.cse72 (select .cse13 .cse74)) (.cse1 (* c_~N~0 3)) (.cse48 (+ c_main_~i~0 1))) (let ((.cse23 (+ c_main_~a~0.offset 4)) (.cse34 (store .cse13 .cse74 1)) (.cse46 (< 0 c_main_~i~0)) (.cse47 (< c_main_~i~0 0)) (.cse2 (<= c_~N~0 .cse48)) (.cse9 (+ .cse1 1)) (.cse8 (+ c_main_~c~0.offset 4)) (.cse5 (+ 4 c_main_~b~0.offset)) (.cse54 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ .cse0 .cse72)))) (.cse14 (+ .cse73 c_main_~a~0.offset 4)) (.cse15 (< (+ c_main_~i~0 2) c_~N~0))) (and (<= (+ .cse0 4) .cse1) (or .cse2 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse3 (let ((.cse11 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ .cse0 (select .cse13 .cse14)))))) (store .cse11 c_main_~b~0.base (store (store (select .cse11 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_328) .cse5 v_ArrVal_330))))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse6 (let ((.cse10 (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| v_ArrVal_334)))) (store .cse10 c_main_~c~0.base (store (store (select .cse10 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_337) .cse8 v_ArrVal_339))))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (or (< (+ v_ArrVal_332 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| v_ArrVal_332)) c_main_~b~0.base) .cse5)) v_ArrVal_334) (< (+ v_ArrVal_341 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| v_ArrVal_341)) c_main_~c~0.base) .cse8)) .cse9) (< 1 v_ArrVal_337) (< 1 v_ArrVal_328) (< (+ v_ArrVal_328 (select .cse4 |c_main_~#sum~0.offset|)) v_ArrVal_332) (< (+ v_ArrVal_337 (select .cse7 |c_main_~#sum~0.offset|)) v_ArrVal_341) (< 1 v_ArrVal_339) (< 1 v_ArrVal_330))))))) .cse15) (not (= c_main_~b~0.base |c_main_~#sum~0.base|)) (or (< 2 c_~N~0) (<= c_~N~0 1) (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse19 (let ((.cse21 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (let ((.cse22 (select .cse13 c_main_~a~0.offset))) (+ .cse22 .cse0 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ .cse22 .cse0))) c_main_~a~0.base) .cse23))))))) (store .cse21 c_main_~b~0.base (store (store (select .cse21 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_328) .cse5 v_ArrVal_330))))) (let ((.cse16 (select .cse19 |c_main_~#sum~0.base|))) (let ((.cse17 (let ((.cse20 (store .cse19 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| v_ArrVal_334)))) (store .cse20 c_main_~c~0.base (store (store (select .cse20 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_337) .cse8 v_ArrVal_339))))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.base|))) (or (< 1 v_ArrVal_337) (< 1 v_ArrVal_328) (< (+ v_ArrVal_328 (select .cse16 |c_main_~#sum~0.offset|)) v_ArrVal_332) (< (+ v_ArrVal_341 (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| v_ArrVal_341)) c_main_~c~0.base) .cse8)) .cse9) (< (+ v_ArrVal_337 (select .cse18 |c_main_~#sum~0.offset|)) v_ArrVal_341) (< 1 v_ArrVal_339) (< (+ v_ArrVal_332 (select (select (store .cse19 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| v_ArrVal_332)) c_main_~b~0.base) .cse5)) v_ArrVal_334) (< 1 v_ArrVal_330)))))))) (or (< c_main_~i~0 1) (< 1 c_main_~i~0) (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse26 (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_main_~a~0.base .cse34))) (store .cse30 |c_main_~#sum~0.base| (let ((.cse31 (select .cse30 |c_main_~#sum~0.base|))) (store .cse31 |c_main_~#sum~0.offset| (let ((.cse32 (select .cse34 c_main_~a~0.offset)) (.cse33 (select .cse31 |c_main_~#sum~0.offset|))) (+ .cse32 (select (select (store .cse30 |c_main_~#sum~0.base| (store .cse31 |c_main_~#sum~0.offset| (+ .cse32 .cse33))) c_main_~a~0.base) .cse23) .cse33)))))))) (store .cse29 c_main_~b~0.base (store (store (select .cse29 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_328) .cse5 v_ArrVal_330))))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.base|))) (let ((.cse24 (let ((.cse28 (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| v_ArrVal_334)))) (store .cse28 c_main_~c~0.base (store (store (select .cse28 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_337) .cse8 v_ArrVal_339))))) (let ((.cse25 (select .cse24 |c_main_~#sum~0.base|))) (or (< 1 v_ArrVal_337) (< (+ v_ArrVal_341 (select (select (store .cse24 |c_main_~#sum~0.base| (store .cse25 |c_main_~#sum~0.offset| v_ArrVal_341)) c_main_~c~0.base) .cse8)) 7) (< 1 v_ArrVal_328) (< (+ v_ArrVal_332 (select (select (store .cse26 |c_main_~#sum~0.base| (store .cse27 |c_main_~#sum~0.offset| v_ArrVal_332)) c_main_~b~0.base) .cse5)) v_ArrVal_334) (< (+ v_ArrVal_328 (select .cse27 |c_main_~#sum~0.offset|)) v_ArrVal_332) (< (+ v_ArrVal_337 (select .cse25 |c_main_~#sum~0.offset|)) v_ArrVal_341) (< 1 v_ArrVal_339) (< 1 v_ArrVal_330)))))))) (<= 2 c_~N~0) (= c_main_~b~0.offset 0) (or (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse35 (let ((.cse40 (let ((.cse45 (store .cse13 .cse14 1))) (let ((.cse41 (store |c_#memory_int| c_main_~a~0.base .cse45))) (store .cse41 |c_main_~#sum~0.base| (let ((.cse42 (select .cse41 |c_main_~#sum~0.base|))) (store .cse42 |c_main_~#sum~0.offset| (let ((.cse43 (select .cse42 |c_main_~#sum~0.offset|)) (.cse44 (select .cse45 c_main_~a~0.offset))) (+ .cse43 .cse44 (select (select (store .cse41 |c_main_~#sum~0.base| (store .cse42 |c_main_~#sum~0.offset| (+ .cse43 .cse44))) c_main_~a~0.base) .cse23)))))))))) (store .cse40 c_main_~b~0.base (store (store (select .cse40 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_328) .cse5 v_ArrVal_330))))) (let ((.cse36 (select .cse35 |c_main_~#sum~0.base|))) (let ((.cse38 (let ((.cse39 (store .cse35 |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| v_ArrVal_334)))) (store .cse39 c_main_~c~0.base (store (store (select .cse39 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_337) .cse8 v_ArrVal_339))))) (let ((.cse37 (select .cse38 |c_main_~#sum~0.base|))) (or (< (+ v_ArrVal_332 (select (select (store .cse35 |c_main_~#sum~0.base| (store .cse36 |c_main_~#sum~0.offset| v_ArrVal_332)) c_main_~b~0.base) .cse5)) v_ArrVal_334) (< 1 v_ArrVal_337) (< 1 v_ArrVal_328) (< (+ v_ArrVal_337 (select .cse37 |c_main_~#sum~0.offset|)) v_ArrVal_341) (< (+ v_ArrVal_328 (select .cse36 |c_main_~#sum~0.offset|)) v_ArrVal_332) (< (+ v_ArrVal_341 (select (select (store .cse38 |c_main_~#sum~0.base| (store .cse37 |c_main_~#sum~0.offset| v_ArrVal_341)) c_main_~c~0.base) .cse8)) 7) (< 1 v_ArrVal_339) (< 1 v_ArrVal_330))))))) .cse46 .cse47) (not (= c_main_~c~0.base |c_main_~#sum~0.base|)) (or (<= c_~N~0 c_main_~i~0) (< .cse48 c_~N~0) (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse51 (store .cse54 c_main_~b~0.base (store (store (select .cse54 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_328) .cse5 v_ArrVal_330)))) (let ((.cse52 (select .cse51 |c_main_~#sum~0.base|))) (let ((.cse49 (let ((.cse53 (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| v_ArrVal_334)))) (store .cse53 c_main_~c~0.base (store (store (select .cse53 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_337) .cse8 v_ArrVal_339))))) (let ((.cse50 (select .cse49 |c_main_~#sum~0.base|))) (or (< 1 v_ArrVal_337) (< (+ (select (select (store .cse49 |c_main_~#sum~0.base| (store .cse50 |c_main_~#sum~0.offset| v_ArrVal_341)) c_main_~c~0.base) .cse8) v_ArrVal_341) .cse9) (< 1 v_ArrVal_328) (< (+ v_ArrVal_332 (select (select (store .cse51 |c_main_~#sum~0.base| (store .cse52 |c_main_~#sum~0.offset| v_ArrVal_332)) c_main_~b~0.base) .cse5)) v_ArrVal_334) (< (+ v_ArrVal_328 (select .cse52 |c_main_~#sum~0.offset|)) v_ArrVal_332) (< 1 v_ArrVal_339) (< (+ v_ArrVal_337 (select .cse50 |c_main_~#sum~0.offset|)) v_ArrVal_341) (< 1 v_ArrVal_330)))))))) (= c_main_~c~0.offset 0) (or (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse56 (let ((.cse60 (let ((.cse65 (store .cse34 .cse14 1))) (let ((.cse61 (store |c_#memory_int| c_main_~a~0.base .cse65))) (store .cse61 |c_main_~#sum~0.base| (let ((.cse62 (select .cse61 |c_main_~#sum~0.base|))) (store .cse62 |c_main_~#sum~0.offset| (let ((.cse63 (select .cse65 c_main_~a~0.offset)) (.cse64 (select .cse62 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse61 |c_main_~#sum~0.base| (store .cse62 |c_main_~#sum~0.offset| (+ .cse63 .cse64))) c_main_~a~0.base) .cse23) .cse63 .cse64))))))))) (store .cse60 c_main_~b~0.base (store (store (select .cse60 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_328) .cse5 v_ArrVal_330))))) (let ((.cse55 (select .cse56 |c_main_~#sum~0.base|))) (let ((.cse57 (let ((.cse59 (store .cse56 |c_main_~#sum~0.base| (store .cse55 |c_main_~#sum~0.offset| v_ArrVal_334)))) (store .cse59 c_main_~c~0.base (store (store (select .cse59 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_337) .cse8 v_ArrVal_339))))) (let ((.cse58 (select .cse57 |c_main_~#sum~0.base|))) (or (< (+ v_ArrVal_328 (select .cse55 |c_main_~#sum~0.offset|)) v_ArrVal_332) (< 1 v_ArrVal_337) (< (+ (select (select (store .cse56 |c_main_~#sum~0.base| (store .cse55 |c_main_~#sum~0.offset| v_ArrVal_332)) c_main_~b~0.base) .cse5) v_ArrVal_332) v_ArrVal_334) (< (+ v_ArrVal_341 (select (select (store .cse57 |c_main_~#sum~0.base| (store .cse58 |c_main_~#sum~0.offset| v_ArrVal_341)) c_main_~c~0.base) .cse8)) 7) (< 1 v_ArrVal_328) (< (+ v_ArrVal_337 (select .cse58 |c_main_~#sum~0.offset|)) v_ArrVal_341) (< 1 v_ArrVal_339) (< 1 v_ArrVal_330))))))) .cse46 .cse47) (or .cse2 (forall ((v_ArrVal_334 Int) (v_ArrVal_332 Int) (v_ArrVal_330 Int) (v_ArrVal_341 Int) (v_ArrVal_328 Int) (v_ArrVal_339 Int) (v_ArrVal_337 Int)) (let ((.cse68 (let ((.cse71 (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse12 |c_main_~#sum~0.offset| (+ .cse0 .cse72 (select (select .cse54 c_main_~a~0.base) .cse14)))))) (store .cse71 c_main_~b~0.base (store (store (select .cse71 c_main_~b~0.base) c_main_~b~0.offset v_ArrVal_328) .cse5 v_ArrVal_330))))) (let ((.cse69 (select .cse68 |c_main_~#sum~0.base|))) (let ((.cse66 (let ((.cse70 (store .cse68 |c_main_~#sum~0.base| (store .cse69 |c_main_~#sum~0.offset| v_ArrVal_334)))) (store .cse70 c_main_~c~0.base (store (store (select .cse70 c_main_~c~0.base) c_main_~c~0.offset v_ArrVal_337) .cse8 v_ArrVal_339))))) (let ((.cse67 (select .cse66 |c_main_~#sum~0.base|))) (or (< 1 v_ArrVal_337) (< 1 v_ArrVal_328) (< (+ v_ArrVal_341 (select (select (store .cse66 |c_main_~#sum~0.base| (store .cse67 |c_main_~#sum~0.offset| v_ArrVal_341)) c_main_~c~0.base) .cse8)) .cse9) (< (+ v_ArrVal_332 (select (select (store .cse68 |c_main_~#sum~0.base| (store .cse69 |c_main_~#sum~0.offset| v_ArrVal_332)) c_main_~b~0.base) .cse5)) v_ArrVal_334) (< (+ v_ArrVal_328 (select .cse69 |c_main_~#sum~0.offset|)) v_ArrVal_332) (< (+ v_ArrVal_337 (select .cse67 |c_main_~#sum~0.offset|)) v_ArrVal_341) (< 1 v_ArrVal_339) (< 1 v_ArrVal_330))))))) .cse15)))))) is different from true [2023-04-01 20:02:27,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-01 20:02:29,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-01 20:03:01,502 WARN L223 SmtUtils]: Spent 30.21s on a formula simplification. DAG size of input: 198 DAG size of output: 197 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:03:03,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-04-01 20:03:16,297 WARN L223 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 156 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 20:03:18,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]