/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/s12if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-30 22:34:12,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-30 22:34:12,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-30 22:34:12,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-30 22:34:12,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-30 22:34:12,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-30 22:34:12,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-30 22:34:12,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-30 22:34:12,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-30 22:34:12,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-30 22:34:12,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-30 22:34:12,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-30 22:34:12,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-30 22:34:12,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-30 22:34:12,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-30 22:34:12,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-30 22:34:12,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-30 22:34:12,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-30 22:34:12,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-30 22:34:12,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-30 22:34:12,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-30 22:34:12,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-30 22:34:12,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-30 22:34:12,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-30 22:34:12,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-30 22:34:12,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-30 22:34:12,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-30 22:34:12,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-30 22:34:12,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-30 22:34:12,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-30 22:34:12,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-30 22:34:12,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-30 22:34:12,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-30 22:34:12,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-30 22:34:12,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-30 22:34:12,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-30 22:34:12,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-30 22:34:12,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-30 22:34:12,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-30 22:34:12,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-30 22:34:12,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-30 22:34:12,527 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-03-30 22:34:12,555 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-30 22:34:12,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-30 22:34:12,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-30 22:34:12,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-30 22:34:12,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-30 22:34:12,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-30 22:34:12,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-30 22:34:12,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-30 22:34:12,558 INFO L138 SettingsManager]: * Use SBE=true [2023-03-30 22:34:12,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-30 22:34:12,559 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-30 22:34:12,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-30 22:34:12,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-30 22:34:12,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-30 22:34:12,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-30 22:34:12,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-30 22:34:12,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-30 22:34:12,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 22:34:12,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-30 22:34:12,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-30 22:34:12,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-30 22:34:12,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-30 22:34:12,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-30 22:34:12,562 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-30 22:34:12,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-30 22:34:12,562 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-30 22:34:12,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-30 22:34:12,562 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-30 22:34:12,562 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-03-30 22:34:12,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-30 22:34:12,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-30 22:34:12,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-30 22:34:12,811 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-30 22:34:12,811 INFO L275 PluginConnector]: CDTParser initialized [2023-03-30 22:34:12,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12if.c [2023-03-30 22:34:14,079 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-30 22:34:14,257 INFO L351 CDTParser]: Found 1 translation units. [2023-03-30 22:34:14,257 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12if.c [2023-03-30 22:34:14,262 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba432f68/a6f55462e5ec46ea9e4288d66cb897f3/FLAGf496d96f5 [2023-03-30 22:34:14,273 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba432f68/a6f55462e5ec46ea9e4288d66cb897f3 [2023-03-30 22:34:14,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-30 22:34:14,276 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-30 22:34:14,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-30 22:34:14,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-30 22:34:14,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-30 22:34:14,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc6876b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14, skipping insertion in model container [2023-03-30 22:34:14,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-30 22:34:14,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-30 22:34:14,421 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/s12if.c[588,601] [2023-03-30 22:34:14,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 22:34:14,466 INFO L203 MainTranslator]: Completed pre-run [2023-03-30 22:34:14,483 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/s12if.c[588,601] [2023-03-30 22:34:14,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-30 22:34:14,515 INFO L208 MainTranslator]: Completed translation [2023-03-30 22:34:14,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14 WrapperNode [2023-03-30 22:34:14,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-30 22:34:14,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-30 22:34:14,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-30 22:34:14,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-30 22:34:14,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,564 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-30 22:34:14,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-30 22:34:14,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-30 22:34:14,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-30 22:34:14,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (1/1) ... [2023-03-30 22:34:14,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-30 22:34:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:14,602 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-03-30 22:34:14,626 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-03-30 22:34:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-30 22:34:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-30 22:34:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-30 22:34:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-03-30 22:34:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-03-30 22:34:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-30 22:34:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-30 22:34:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-30 22:34:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-30 22:34:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-30 22:34:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-30 22:34:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-30 22:34:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-30 22:34:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-30 22:34:14,731 INFO L236 CfgBuilder]: Building ICFG [2023-03-30 22:34:14,734 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-30 22:34:14,935 INFO L277 CfgBuilder]: Performing block encoding [2023-03-30 22:34:14,939 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-30 22:34:14,939 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-03-30 22:34:14,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 10:34:14 BoogieIcfgContainer [2023-03-30 22:34:14,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-30 22:34:14,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-30 22:34:14,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-30 22:34:14,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-30 22:34:14,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.03 10:34:14" (1/3) ... [2023-03-30 22:34:14,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd6bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 10:34:14, skipping insertion in model container [2023-03-30 22:34:14,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.03 10:34:14" (2/3) ... [2023-03-30 22:34:14,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd6bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.03 10:34:14, skipping insertion in model container [2023-03-30 22:34:14,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.03 10:34:14" (3/3) ... [2023-03-30 22:34:14,958 INFO L112 eAbstractionObserver]: Analyzing ICFG s12if.c [2023-03-30 22:34:14,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-30 22:34:14,988 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-03-30 22:34:15,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-30 22:34:15,055 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;@23890251, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-30 22:34:15,056 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-30 22:34:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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-03-30 22:34:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-03-30 22:34:15,068 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:15,069 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] [2023-03-30 22:34:15,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:15,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1742232210, now seen corresponding path program 1 times [2023-03-30 22:34:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975915689] [2023-03-30 22:34:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:15,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:34:15,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:15,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975915689] [2023-03-30 22:34:15,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975915689] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:34:15,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 22:34:15,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-30 22:34:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450598313] [2023-03-30 22:34:15,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:34:15,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-30 22:34:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-30 22:34:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-30 22:34:15,322 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-03-30 22:34:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:15,410 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2023-03-30 22:34:15,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-30 22:34:15,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 23 [2023-03-30 22:34:15,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:15,418 INFO L225 Difference]: With dead ends: 62 [2023-03-30 22:34:15,418 INFO L226 Difference]: Without dead ends: 29 [2023-03-30 22:34:15,421 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-03-30 22:34:15,424 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:15,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:15,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-03-30 22:34:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-03-30 22:34:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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-03-30 22:34:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-03-30 22:34:15,471 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2023-03-30 22:34:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:15,471 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-03-30 22:34:15,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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-03-30 22:34:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-03-30 22:34:15,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-03-30 22:34:15,472 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:15,473 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] [2023-03-30 22:34:15,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-30 22:34:15,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:15,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash 416194299, now seen corresponding path program 1 times [2023-03-30 22:34:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:15,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954680819] [2023-03-30 22:34:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:15,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:34:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954680819] [2023-03-30 22:34:15,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954680819] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-30 22:34:15,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-30 22:34:15,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-30 22:34:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789104775] [2023-03-30 22:34:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-30 22:34:15,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-30 22:34:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:15,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-30 22:34:15,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-03-30 22:34:15,682 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-03-30 22:34:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:15,844 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2023-03-30 22:34:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-30 22:34:15,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 23 [2023-03-30 22:34:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:15,846 INFO L225 Difference]: With dead ends: 51 [2023-03-30 22:34:15,846 INFO L226 Difference]: Without dead ends: 37 [2023-03-30 22:34:15,846 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-03-30 22:34:15,847 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:15,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 22 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:15,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-03-30 22:34:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2023-03-30 22:34:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-03-30 22:34:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-03-30 22:34:15,855 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2023-03-30 22:34:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:15,855 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-03-30 22:34:15,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-03-30 22:34:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-03-30 22:34:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-30 22:34:15,856 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:15,856 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] [2023-03-30 22:34:15,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-30 22:34:15,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:15,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash -708797194, now seen corresponding path program 1 times [2023-03-30 22:34:15,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:15,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090721922] [2023-03-30 22:34:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:16,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:16,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090721922] [2023-03-30 22:34:16,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090721922] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:16,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197800575] [2023-03-30 22:34:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:16,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:16,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:16,809 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-03-30 22:34:16,825 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-03-30 22:34:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:16,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjunts are in the unsatisfiable core [2023-03-30 22:34:16,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:17,079 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-03-30 22:34:17,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:17,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:17,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:17,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:17,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:17,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-03-30 22:34:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:17,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:17,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:34:17,846 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-03-30 22:34:17,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-30 22:34:17,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-03-30 22:34:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-30 22:34:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197800575] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:18,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 33 [2023-03-30 22:34:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410603265] [2023-03-30 22:34:18,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:18,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-03-30 22:34:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:18,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-03-30 22:34:18,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=878, Unknown=5, NotChecked=0, Total=1056 [2023-03-30 22:34:18,037 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-30 22:34:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:18,912 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2023-03-30 22:34:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-03-30 22:34:18,913 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-03-30 22:34:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:18,915 INFO L225 Difference]: With dead ends: 58 [2023-03-30 22:34:18,915 INFO L226 Difference]: Without dead ends: 52 [2023-03-30 22:34:18,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=385, Invalid=1866, Unknown=5, NotChecked=0, Total=2256 [2023-03-30 22:34:18,917 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 39 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:18,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 77 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 491 Invalid, 4 Unknown, 0 Unchecked, 0.4s Time] [2023-03-30 22:34:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-03-30 22:34:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2023-03-30 22:34:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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-03-30 22:34:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-03-30 22:34:18,927 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 31 [2023-03-30 22:34:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:18,927 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-03-30 22:34:18,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-03-30 22:34:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-03-30 22:34:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-30 22:34:18,929 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:18,929 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] [2023-03-30 22:34:18,940 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-03-30 22:34:19,129 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-03-30 22:34:19,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:19,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1518143820, now seen corresponding path program 1 times [2023-03-30 22:34:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:19,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714514936] [2023-03-30 22:34:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:19,146 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:34:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417545693] [2023-03-30 22:34:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:19,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:19,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:19,148 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-03-30 22:34:19,151 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-03-30 22:34:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:19,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjunts are in the unsatisfiable core [2023-03-30 22:34:19,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:19,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-30 22:34:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:19,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:19,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-03-30 22:34:19,325 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:34:19,325 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 24 treesize of output 16 [2023-03-30 22:34:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:19,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714514936] [2023-03-30 22:34:19,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:34:19,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417545693] [2023-03-30 22:34:19,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417545693] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:19,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:34:19,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-03-30 22:34:19,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732663218] [2023-03-30 22:34:19,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:19,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-30 22:34:19,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-30 22:34:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-03-30 22:34:19,364 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:19,499 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2023-03-30 22:34:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-30 22:34:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-03-30 22:34:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:19,502 INFO L225 Difference]: With dead ends: 89 [2023-03-30 22:34:19,502 INFO L226 Difference]: Without dead ends: 75 [2023-03-30 22:34:19,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-03-30 22:34:19,503 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:19,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-03-30 22:34:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2023-03-30 22:34:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 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-03-30 22:34:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2023-03-30 22:34:19,516 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 31 [2023-03-30 22:34:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:19,517 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2023-03-30 22:34:19,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2023-03-30 22:34:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-30 22:34:19,518 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:19,518 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] [2023-03-30 22:34:19,526 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-03-30 22:34:19,724 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-03-30 22:34:19,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:19,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:19,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2104949834, now seen corresponding path program 1 times [2023-03-30 22:34:19,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:19,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919621446] [2023-03-30 22:34:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:19,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:19,737 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:34:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732494988] [2023-03-30 22:34:19,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:19,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:19,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:19,739 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-03-30 22:34:19,742 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-03-30 22:34:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:19,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjunts are in the unsatisfiable core [2023-03-30 22:34:19,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:19,820 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-03-30 22:34:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:19,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:19,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-03-30 22:34:19,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-03-30 22:34:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:19,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919621446] [2023-03-30 22:34:19,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:34:19,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732494988] [2023-03-30 22:34:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732494988] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:19,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:34:19,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-03-30 22:34:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302911562] [2023-03-30 22:34:19,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:19,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-03-30 22:34:19,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:19,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-03-30 22:34:19,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-03-30 22:34:19,887 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:19,963 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2023-03-30 22:34:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-03-30 22:34:19,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-03-30 22:34:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:19,966 INFO L225 Difference]: With dead ends: 90 [2023-03-30 22:34:19,966 INFO L226 Difference]: Without dead ends: 67 [2023-03-30 22:34:19,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-03-30 22:34:19,967 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:19,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-03-30 22:34:19,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-03-30 22:34:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2023-03-30 22:34:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 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-03-30 22:34:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2023-03-30 22:34:19,980 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 31 [2023-03-30 22:34:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:19,980 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2023-03-30 22:34:19,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2023-03-30 22:34:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-03-30 22:34:19,981 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:19,981 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] [2023-03-30 22:34:19,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:20,187 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-03-30 22:34:20,188 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:20,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1233490552, now seen corresponding path program 2 times [2023-03-30 22:34:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:20,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192237920] [2023-03-30 22:34:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:20,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192237920] [2023-03-30 22:34:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192237920] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701093146] [2023-03-30 22:34:20,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 22:34:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:20,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:20,297 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-03-30 22:34:20,313 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-03-30 22:34:20,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 22:34:20,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:20,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-30 22:34:20,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:20,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701093146] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:20,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-03-30 22:34:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462952531] [2023-03-30 22:34:20,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:20,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-30 22:34:20,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-30 22:34:20,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-03-30 22:34:20,473 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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-03-30 22:34:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:20,690 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2023-03-30 22:34:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-30 22:34:20,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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 33 [2023-03-30 22:34:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:20,692 INFO L225 Difference]: With dead ends: 97 [2023-03-30 22:34:20,695 INFO L226 Difference]: Without dead ends: 85 [2023-03-30 22:34:20,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 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-03-30 22:34:20,699 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:20,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 62 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-03-30 22:34:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2023-03-30 22:34:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 56 states have internal predecessors, (72), 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-03-30 22:34:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2023-03-30 22:34:20,727 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 33 [2023-03-30 22:34:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:20,727 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2023-03-30 22:34:20,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 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-03-30 22:34:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2023-03-30 22:34:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-03-30 22:34:20,732 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:20,732 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-30 22:34:20,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:20,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:20,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:20,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash -41402357, now seen corresponding path program 3 times [2023-03-30 22:34:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926212404] [2023-03-30 22:34:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926212404] [2023-03-30 22:34:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926212404] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:21,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543321352] [2023-03-30 22:34:21,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-30 22:34:21,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:21,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:21,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:21,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-30 22:34:21,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-03-30 22:34:21,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:21,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2023-03-30 22:34:21,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:21,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-30 22:34:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543321352] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:21,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:21,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2023-03-30 22:34:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914772543] [2023-03-30 22:34:21,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:21,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-30 22:34:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-30 22:34:21,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-03-30 22:34:21,205 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (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-03-30 22:34:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:21,351 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2023-03-30 22:34:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-03-30 22:34:21,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (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 34 [2023-03-30 22:34:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:21,352 INFO L225 Difference]: With dead ends: 90 [2023-03-30 22:34:21,352 INFO L226 Difference]: Without dead ends: 52 [2023-03-30 22:34:21,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 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-03-30 22:34:21,353 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:21,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 40 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-03-30 22:34:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2023-03-30 22:34:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 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-03-30 22:34:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-03-30 22:34:21,362 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 34 [2023-03-30 22:34:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:21,362 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-03-30 22:34:21,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (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-03-30 22:34:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-03-30 22:34:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-03-30 22:34:21,363 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:21,363 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-30 22:34:21,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:21,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:21,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:21,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:21,570 INFO L85 PathProgramCache]: Analyzing trace with hash 854203999, now seen corresponding path program 4 times [2023-03-30 22:34:21,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:21,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426852167] [2023-03-30 22:34:21,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:21,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-03-30 22:34:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426852167] [2023-03-30 22:34:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426852167] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895594926] [2023-03-30 22:34:22,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-30 22:34:22,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:22,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:22,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:22,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-03-30 22:34:22,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-30 22:34:22,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:22,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2023-03-30 22:34:22,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:22,426 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-03-30 22:34:22,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:22,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:22,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:22,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:22,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:22,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:22,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:22,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:22,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:22,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-03-30 22:34:22,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:22,837 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:34:22,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-03-30 22:34:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-30 22:34:22,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:23,310 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_206 (Array Int Int)) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_61 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* main_~i~0 4))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (= (* c_~N~0 2) (+ .cse2 4))))))) is different from false [2023-03-30 22:34:23,569 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_main_~i~0 2))) (and (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< (+ .cse2 1) .cse3)))))) (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< .cse3 (+ 3 .cse6))))))))) is different from false [2023-03-30 22:34:23,601 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~i~0 2))) (and (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse3 |c_main_~#sum~0.offset|))) (or (< .cse0 (+ .cse1 1)) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 2 .cse1))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4)))))))))) (forall ((v_ArrVal_206 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_67 Int) (v_main_~i~0_61 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_206))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* v_main_~i~0_61 4))) 2)) (not (= 2 (select v_ArrVal_206 (+ main_~a~0.offset (* v_main_~i~0_67 4))))) (< .cse6 (+ .cse0 1))))))))) is different from false [2023-03-30 22:34:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2023-03-30 22:34:23,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895594926] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:23,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:23,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 40 [2023-03-30 22:34:23,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146354276] [2023-03-30 22:34:23,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:23,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-03-30 22:34:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-03-30 22:34:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1195, Unknown=3, NotChecked=216, Total=1560 [2023-03-30 22:34:23,655 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:25,584 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2023-03-30 22:34:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-03-30 22:34:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-03-30 22:34:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:25,586 INFO L225 Difference]: With dead ends: 103 [2023-03-30 22:34:25,586 INFO L226 Difference]: Without dead ends: 97 [2023-03-30 22:34:25,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=443, Invalid=3106, Unknown=3, NotChecked=354, Total=3906 [2023-03-30 22:34:25,588 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 67 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:25,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 174 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1022 Invalid, 11 Unknown, 246 Unchecked, 0.8s Time] [2023-03-30 22:34:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-03-30 22:34:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2023-03-30 22:34:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 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-03-30 22:34:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2023-03-30 22:34:25,601 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 39 [2023-03-30 22:34:25,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:25,601 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2023-03-30 22:34:25,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2023-03-30 22:34:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-03-30 22:34:25,602 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:25,602 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-30 22:34:25,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:25,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:25,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:25,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash 44857373, now seen corresponding path program 1 times [2023-03-30 22:34:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:25,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529405122] [2023-03-30 22:34:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:25,820 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:34:25,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798073195] [2023-03-30 22:34:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:25,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:25,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:25,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:25,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-03-30 22:34:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:25,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2023-03-30 22:34:25,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:25,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-03-30 22:34:25,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-30 22:34:26,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-30 22:34:26,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:26,089 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_252) c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset 4)) 2)) is different from false [2023-03-30 22:34:26,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| v_ArrVal_252) c_main_~a~0.base) (+ c_main_~a~0.offset 4)))) is different from false [2023-03-30 22:34:26,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:34:26,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2023-03-30 22:34:26,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:34:26,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-03-30 22:34:26,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-03-30 22:34:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2023-03-30 22:34:26,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:26,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529405122] [2023-03-30 22:34:26,201 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:34:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798073195] [2023-03-30 22:34:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798073195] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:26,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:34:26,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-03-30 22:34:26,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670076537] [2023-03-30 22:34:26,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:26,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-03-30 22:34:26,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:26,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-03-30 22:34:26,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2023-03-30 22:34:26,204 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:26,558 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2023-03-30 22:34:26,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-30 22:34:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-03-30 22:34:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:26,560 INFO L225 Difference]: With dead ends: 124 [2023-03-30 22:34:26,560 INFO L226 Difference]: Without dead ends: 115 [2023-03-30 22:34:26,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=363, Unknown=2, NotChecked=82, Total=552 [2023-03-30 22:34:26,561 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 103 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:26,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 171 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2023-03-30 22:34:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-03-30 22:34:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 81. [2023-03-30 22:34:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 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-03-30 22:34:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-03-30 22:34:26,575 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 39 [2023-03-30 22:34:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:26,575 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-03-30 22:34:26,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-03-30 22:34:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-03-30 22:34:26,576 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:26,576 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-03-30 22:34:26,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:26,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:26,782 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:26,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash -976210981, now seen corresponding path program 1 times [2023-03-30 22:34:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:26,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233468023] [2023-03-30 22:34:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:26,796 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:34:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [742964063] [2023-03-30 22:34:26,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:26,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:26,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:26,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:26,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-03-30 22:34:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:26,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2023-03-30 22:34:26,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:26,887 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-03-30 22:34:26,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-03-30 22:34:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-30 22:34:26,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:26,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-03-30 22:34:26,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-03-30 22:34:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-30 22:34:27,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233468023] [2023-03-30 22:34:27,016 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:34:27,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742964063] [2023-03-30 22:34:27,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742964063] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:27,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:34:27,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-03-30 22:34:27,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691467755] [2023-03-30 22:34:27,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:27,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-03-30 22:34:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-03-30 22:34:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-03-30 22:34:27,017 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:27,142 INFO L93 Difference]: Finished difference Result 127 states and 160 transitions. [2023-03-30 22:34:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-30 22:34:27,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2023-03-30 22:34:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:27,143 INFO L225 Difference]: With dead ends: 127 [2023-03-30 22:34:27,144 INFO L226 Difference]: Without dead ends: 94 [2023-03-30 22:34:27,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-03-30 22:34:27,145 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:27,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 146 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-03-30 22:34:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2023-03-30 22:34:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 76 states have (on average 1.236842105263158) internal successors, (94), 76 states have internal predecessors, (94), 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-03-30 22:34:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2023-03-30 22:34:27,158 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 39 [2023-03-30 22:34:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:27,158 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2023-03-30 22:34:27,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2023-03-30 22:34:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-03-30 22:34:27,159 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:27,159 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-03-30 22:34:27,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:27,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-03-30 22:34:27,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:27,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:27,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1806332385, now seen corresponding path program 5 times [2023-03-30 22:34:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845730609] [2023-03-30 22:34:27,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:27,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:27,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-30 22:34:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845730609] [2023-03-30 22:34:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845730609] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627795614] [2023-03-30 22:34:27,473 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-03-30 22:34:27,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:27,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:27,477 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:27,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-03-30 22:34:27,571 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-03-30 22:34:27,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:27,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-03-30 22:34:27,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-30 22:34:27,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-30 22:34:27,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627795614] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:27,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:27,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-03-30 22:34:27,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77180445] [2023-03-30 22:34:27,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:27,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-03-30 22:34:27,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:27,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-03-30 22:34:27,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-03-30 22:34:27,718 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 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-03-30 22:34:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:28,015 INFO L93 Difference]: Finished difference Result 133 states and 163 transitions. [2023-03-30 22:34:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-30 22:34:28,015 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 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 41 [2023-03-30 22:34:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:28,016 INFO L225 Difference]: With dead ends: 133 [2023-03-30 22:34:28,016 INFO L226 Difference]: Without dead ends: 118 [2023-03-30 22:34:28,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-03-30 22:34:28,017 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 66 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:28,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 59 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-30 22:34:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-03-30 22:34:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 85. [2023-03-30 22:34:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 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-03-30 22:34:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2023-03-30 22:34:28,042 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 41 [2023-03-30 22:34:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:28,042 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2023-03-30 22:34:28,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 14 states have internal predecessors, (57), 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-03-30 22:34:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2023-03-30 22:34:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-03-30 22:34:28,043 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:28,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2023-03-30 22:34:28,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:28,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:28,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:28,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:28,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1586682370, now seen corresponding path program 6 times [2023-03-30 22:34:28,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:28,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408926410] [2023-03-30 22:34:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-03-30 22:34:28,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:28,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408926410] [2023-03-30 22:34:28,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408926410] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:28,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971611233] [2023-03-30 22:34:28,357 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-03-30 22:34:28,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:28,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:28,361 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:28,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-03-30 22:34:28,449 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-03-30 22:34:28,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:28,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2023-03-30 22:34:28,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-30 22:34:28,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-03-30 22:34:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971611233] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:28,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-03-30 22:34:28,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098529174] [2023-03-30 22:34:28,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:28,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-03-30 22:34:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:28,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-03-30 22:34:28,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2023-03-30 22:34:28,579 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 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-03-30 22:34:28,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:28,753 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2023-03-30 22:34:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-03-30 22:34:28,754 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 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 42 [2023-03-30 22:34:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:28,754 INFO L225 Difference]: With dead ends: 121 [2023-03-30 22:34:28,755 INFO L226 Difference]: Without dead ends: 63 [2023-03-30 22:34:28,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2023-03-30 22:34:28,756 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:28,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 45 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-03-30 22:34:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2023-03-30 22:34:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 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-03-30 22:34:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-03-30 22:34:28,765 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 42 [2023-03-30 22:34:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:28,766 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-03-30 22:34:28,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 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-03-30 22:34:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-03-30 22:34:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-03-30 22:34:28,766 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:28,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:34:28,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:28,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-03-30 22:34:28,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:28,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1783122278, now seen corresponding path program 7 times [2023-03-30 22:34:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:28,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695190563] [2023-03-30 22:34:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:29,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:29,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:29,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695190563] [2023-03-30 22:34:29,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695190563] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:29,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509669052] [2023-03-30 22:34:29,966 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-03-30 22:34:29,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:29,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:29,968 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:29,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-03-30 22:34:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:30,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 58 conjunts are in the unsatisfiable core [2023-03-30 22:34:30,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:30,110 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-03-30 22:34:30,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:30,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:30,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:30,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:30,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:30,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:30,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-03-30 22:34:30,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,649 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:34:30,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-03-30 22:34:30,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-30 22:34:30,787 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:34:30,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-03-30 22:34:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:30,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:31,529 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_main_~i~0_124 Int) (main_~i~0 Int) (main_~a~0.offset Int) (v_main_~i~0_126 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_436))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_126))) 2)) (= (+ 6 .cse2) (* c_~N~0 2)) (not (= 2 (select v_ArrVal_436 (+ main_~a~0.offset (* main_~i~0 4))))) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 4 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_124)))))))))) is different from false [2023-03-30 22:34:32,275 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:34:32,276 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 1 [2023-03-30 22:34:32,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2023-03-30 22:34:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509669052] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:32,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:32,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 18] total 51 [2023-03-30 22:34:32,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316772011] [2023-03-30 22:34:32,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:32,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-03-30 22:34:32,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:32,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-03-30 22:34:32,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2230, Unknown=1, NotChecked=96, Total=2550 [2023-03-30 22:34:32,299 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 51 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 47 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-30 22:34:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:36,758 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2023-03-30 22:34:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-03-30 22:34:36,759 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 47 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-03-30 22:34:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:36,760 INFO L225 Difference]: With dead ends: 136 [2023-03-30 22:34:36,760 INFO L226 Difference]: Without dead ends: 130 [2023-03-30 22:34:36,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=833, Invalid=7359, Unknown=2, NotChecked=178, Total=8372 [2023-03-30 22:34:36,763 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 111 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 173 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:36,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 142 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1792 Invalid, 30 Unknown, 102 Unchecked, 1.7s Time] [2023-03-30 22:34:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-03-30 22:34:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2023-03-30 22:34:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 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-03-30 22:34:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2023-03-30 22:34:36,785 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 47 [2023-03-30 22:34:36,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:36,786 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2023-03-30 22:34:36,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 47 states have internal predecessors, (93), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-03-30 22:34:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2023-03-30 22:34:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-03-30 22:34:36,786 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:36,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2023-03-30 22:34:36,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:36,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-03-30 22:34:36,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:36,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1702498392, now seen corresponding path program 2 times [2023-03-30 22:34:36,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:36,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174623622] [2023-03-30 22:34:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:36,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:37,006 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:34:37,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197956923] [2023-03-30 22:34:37,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 22:34:37,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:37,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:37,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:37,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-03-30 22:34:37,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 22:34:37,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:37,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjunts are in the unsatisfiable core [2023-03-30 22:34:37,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:37,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-03-30 22:34:37,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-03-30 22:34:37,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:37,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-03-30 22:34:37,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:37,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:34:37,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2023-03-30 22:34:37,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-30 22:34:37,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2023-03-30 22:34:37,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-03-30 22:34:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-03-30 22:34:37,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174623622] [2023-03-30 22:34:37,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:34:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197956923] [2023-03-30 22:34:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197956923] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:37,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:34:37,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-03-30 22:34:37,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200344762] [2023-03-30 22:34:37,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:37,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-03-30 22:34:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-03-30 22:34:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=409, Unknown=9, NotChecked=0, Total=506 [2023-03-30 22:34:37,532 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:37,931 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2023-03-30 22:34:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-30 22:34:37,932 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2023-03-30 22:34:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:37,932 INFO L225 Difference]: With dead ends: 154 [2023-03-30 22:34:37,933 INFO L226 Difference]: Without dead ends: 145 [2023-03-30 22:34:37,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=610, Unknown=9, NotChecked=0, Total=756 [2023-03-30 22:34:37,933 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:37,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 224 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-30 22:34:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-03-30 22:34:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2023-03-30 22:34:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 102 states have internal predecessors, (125), 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-03-30 22:34:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2023-03-30 22:34:37,958 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 47 [2023-03-30 22:34:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:37,958 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2023-03-30 22:34:37,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2023-03-30 22:34:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-03-30 22:34:37,959 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:37,959 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-03-30 22:34:37,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:38,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-03-30 22:34:38,171 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:38,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 13554650, now seen corresponding path program 2 times [2023-03-30 22:34:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:38,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774910323] [2023-03-30 22:34:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:38,183 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-03-30 22:34:38,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781997977] [2023-03-30 22:34:38,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 22:34:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:38,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:38,184 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:38,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-03-30 22:34:38,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 22:34:38,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:38,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 31 conjunts are in the unsatisfiable core [2023-03-30 22:34:38,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:38,301 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-03-30 22:34:38,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-03-30 22:34:38,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-03-30 22:34:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:38,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:38,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-03-30 22:34:38,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-03-30 22:34:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:38,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:38,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774910323] [2023-03-30 22:34:38,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-03-30 22:34:38,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781997977] [2023-03-30 22:34:38,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781997977] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:38,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-03-30 22:34:38,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-03-30 22:34:38,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337650525] [2023-03-30 22:34:38,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:38,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-03-30 22:34:38,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:38,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-03-30 22:34:38,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-03-30 22:34:38,483 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:38,674 INFO L93 Difference]: Finished difference Result 171 states and 215 transitions. [2023-03-30 22:34:38,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-03-30 22:34:38,675 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2023-03-30 22:34:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:38,675 INFO L225 Difference]: With dead ends: 171 [2023-03-30 22:34:38,675 INFO L226 Difference]: Without dead ends: 124 [2023-03-30 22:34:38,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-03-30 22:34:38,676 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:38,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 178 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-30 22:34:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-03-30 22:34:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2023-03-30 22:34:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 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-03-30 22:34:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2023-03-30 22:34:38,699 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 47 [2023-03-30 22:34:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:38,699 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2023-03-30 22:34:38,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2023-03-30 22:34:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-03-30 22:34:38,700 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:38,700 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:34:38,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:38,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-03-30 22:34:38,900 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:38,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1992988644, now seen corresponding path program 8 times [2023-03-30 22:34:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:38,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117408276] [2023-03-30 22:34:38,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:39,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117408276] [2023-03-30 22:34:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117408276] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280292991] [2023-03-30 22:34:39,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-03-30 22:34:39,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:39,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:39,037 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:39,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-03-30 22:34:39,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-03-30 22:34:39,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:39,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2023-03-30 22:34:39,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:39,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280292991] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:39,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:39,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-03-30 22:34:39,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388817311] [2023-03-30 22:34:39,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:39,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-30 22:34:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:39,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-30 22:34:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-03-30 22:34:39,283 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 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-03-30 22:34:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:39,662 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2023-03-30 22:34:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-03-30 22:34:39,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 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 49 [2023-03-30 22:34:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:39,663 INFO L225 Difference]: With dead ends: 172 [2023-03-30 22:34:39,663 INFO L226 Difference]: Without dead ends: 154 [2023-03-30 22:34:39,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2023-03-30 22:34:39,664 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:39,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 75 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-30 22:34:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-03-30 22:34:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 110. [2023-03-30 22:34:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 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-03-30 22:34:39,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2023-03-30 22:34:39,688 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 49 [2023-03-30 22:34:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:39,688 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2023-03-30 22:34:39,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 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-03-30 22:34:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2023-03-30 22:34:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-03-30 22:34:39,689 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:39,689 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:34:39,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:39,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:39,895 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:39,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 836309991, now seen corresponding path program 9 times [2023-03-30 22:34:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82884208] [2023-03-30 22:34:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:40,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82884208] [2023-03-30 22:34:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82884208] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:40,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756366397] [2023-03-30 22:34:40,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-03-30 22:34:40,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:40,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:40,044 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:40,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-03-30 22:34:40,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-03-30 22:34:40,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:40,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-03-30 22:34:40,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:40,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:40,327 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-03-30 22:34:40,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756366397] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:40,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:40,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2023-03-30 22:34:40,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185283447] [2023-03-30 22:34:40,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:40,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-30 22:34:40,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:40,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-30 22:34:40,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-03-30 22:34:40,329 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 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-03-30 22:34:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-30 22:34:40,559 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2023-03-30 22:34:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-30 22:34:40,559 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 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 50 [2023-03-30 22:34:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-30 22:34:40,560 INFO L225 Difference]: With dead ends: 155 [2023-03-30 22:34:40,560 INFO L226 Difference]: Without dead ends: 74 [2023-03-30 22:34:40,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2023-03-30 22:34:40,561 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 70 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-03-30 22:34:40,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 45 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-03-30 22:34:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-03-30 22:34:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2023-03-30 22:34:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 61 states have internal predecessors, (71), 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-03-30 22:34:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-03-30 22:34:40,575 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 50 [2023-03-30 22:34:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-30 22:34:40,575 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-03-30 22:34:40,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 17 states have internal predecessors, (57), 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-03-30 22:34:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-03-30 22:34:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-03-30 22:34:40,576 INFO L187 NwaCegarLoop]: Found error trace [2023-03-30 22:34:40,576 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-30 22:34:40,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-03-30 22:34:40,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-03-30 22:34:40,795 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-30 22:34:40,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-30 22:34:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash -217929789, now seen corresponding path program 10 times [2023-03-30 22:34:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-30 22:34:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042562297] [2023-03-30 22:34:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-30 22:34:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-30 22:34:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:41,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-30 22:34:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-03-30 22:34:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-30 22:34:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-03-30 22:34:41,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-30 22:34:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042562297] [2023-03-30 22:34:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042562297] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-30 22:34:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578695023] [2023-03-30 22:34:41,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-03-30 22:34:41,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-30 22:34:41,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-30 22:34:41,971 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-30 22:34:41,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-03-30 22:34:42,076 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-03-30 22:34:42,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-03-30 22:34:42,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 67 conjunts are in the unsatisfiable core [2023-03-30 22:34:42,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-30 22:34:42,084 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-03-30 22:34:42,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-03-30 22:34:42,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-30 22:34:42,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-03-30 22:34:42,545 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-03-30 22:34:42,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-03-30 22:34:42,735 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-03-30 22:34:42,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 53 [2023-03-30 22:34:42,966 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-03-30 22:34:42,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 67 [2023-03-30 22:34:43,292 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-03-30 22:34:43,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 16 [2023-03-30 22:34:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-03-30 22:34:43,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-30 22:34:45,711 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (< (+ v_main_~i~0_215 1) c_~N~0) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (= (* c_~N~0 2) (+ .cse2 8))))))) is different from false [2023-03-30 22:34:48,270 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~i~0 1))) (and (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< (* 2 v_main_~i~0_215) (+ 7 .cse2)) (< v_main_~i~0_215 .cse3)))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse6 (select .cse5 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse6 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 2 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ 6 .cse6))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ 3 .cse6) (* c_main_~i~0 2)) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3)))))))) is different from false [2023-03-30 22:34:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 22 refuted. 2 times theorem prover too weak. 15 trivial. 19 not checked. [2023-03-30 22:34:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578695023] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-30 22:34:51,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-30 22:34:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 25] total 67 [2023-03-30 22:34:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848248472] [2023-03-30 22:34:51,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-30 22:34:51,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-03-30 22:34:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-30 22:34:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-03-30 22:34:51,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=3817, Unknown=38, NotChecked=254, Total=4422 [2023-03-30 22:34:51,116 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 67 states, 65 states have (on average 1.646153846153846) internal successors, (107), 64 states have internal predecessors, (107), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-03-30 22:34:58,092 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse0 (select .cse20 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (.cse8 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse10 (+ c_main_~i~0 1)) (.cse7 (select .cse8 |c_main_~#sum~0.offset|)) (.cse1 (= 2 .cse0))) (let ((.cse11 (not .cse1)) (.cse12 (<= .cse7 2)) (.cse5 (+ c_main_~i~0 3)) (.cse14 (not (= 2 |c_main_#t~mem12|))) (.cse15 (+ .cse7 .cse0)) (.cse16 (< .cse10 c_~N~0)) (.cse9 (+ .cse7 2)) (.cse6 (* c_~N~0 2)) (.cse13 (<= 2 .cse7))) (and (or (= .cse0 |c_main_#t~mem12|) .cse1) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse2 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse3 (select .cse2 |c_main_~#sum~0.base|))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ .cse4 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 2 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse2 |c_main_~#sum~0.base| (store .cse3 |c_main_~#sum~0.offset| (+ 6 .cse4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse5) (< (* 2 v_main_~i~0_215) (+ 7 .cse4))))))) (or (= .cse6 (+ .cse7 4)) (forall ((v_main_~i~0_215 Int)) (or (not (= (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| .cse9)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse10 v_main_~i~0_215))) .cse11) (= c_~N~0 4) (or (and .cse12 .cse13) .cse11) (or .cse14 (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse10 v_main_~i~0_215) (not (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| .cse15)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))))))) (= .cse6 (+ .cse7 2 .cse0))) .cse12 (or (= .cse7 .cse6) .cse16) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse17 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.base|))) (let ((.cse19 (select .cse18 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ .cse19 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 2 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 6 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse5) (< .cse19 (+ (* c_main_~i~0 2) 1))))))) (or .cse14 (= .cse15 .cse6) .cse16) (or (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse10 v_main_~i~0_215) (not (= (select .cse20 (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)))) (= .cse9 .cse6)) .cse13))))) is different from false [2023-03-30 22:34:59,561 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)))) (let ((.cse2 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse1 (= 2 .cse0))) (let ((.cse5 (not .cse1)) (.cse14 (<= .cse2 2)) (.cse9 (+ c_main_~i~0 3)) (.cse3 (* c_~N~0 2)) (.cse4 (< (+ c_main_~i~0 1) c_~N~0)) (.cse19 (* c_main_~i~0 2)) (.cse13 (+ c_main_~i~0 2)) (.cse15 (<= 2 .cse2))) (and (or (= .cse0 |c_main_#t~mem12|) .cse1) (or (= (+ .cse2 2) .cse3) .cse4 .cse5) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse6 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse7 (select .cse6 |c_main_~#sum~0.base|))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ .cse8 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 2 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse6 |c_main_~#sum~0.base| (store .cse7 |c_main_~#sum~0.offset| (+ 6 .cse8))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse9) (< (* 2 v_main_~i~0_215) (+ 7 .cse8))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse10 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse11 (select .cse10 |c_main_~#sum~0.base|))) (let ((.cse12 (select .cse11 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ .cse12 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ 2 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse10 |c_main_~#sum~0.base| (store .cse11 |c_main_~#sum~0.offset| (+ 6 .cse12))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse13) (< (* 2 v_main_~i~0_215) (+ 7 .cse12))))))) (= c_~N~0 4) (or (and .cse14 .cse15) .cse5) .cse14 (or (= .cse2 .cse3) .cse4) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse16 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse17 (select .cse16 |c_main_~#sum~0.base|))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ .cse18 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 2 .cse18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse16 |c_main_~#sum~0.base| (store .cse17 |c_main_~#sum~0.offset| (+ 6 .cse18))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse9) (< .cse18 (+ .cse19 1))))))) (or (not (= 2 |c_main_#t~mem12|)) (= (+ .cse2 .cse0) .cse3) .cse4) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse20 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse21 (select .cse20 |c_main_~#sum~0.base|))) (let ((.cse22 (select .cse21 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ .cse22 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ 2 .cse22))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (< (+ .cse22 1) .cse19) (not (= (select (select (store .cse20 |c_main_~#sum~0.base| (store .cse21 |c_main_~#sum~0.offset| (+ 6 .cse22))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse13)))))) .cse15)))) is different from false [2023-03-30 22:35:00,717 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_main_~#sum~0.base|))) (let ((.cse12 (select .cse10 |c_main_~#sum~0.offset|)) (.cse18 (select |c_#memory_int| c_main_~a~0.base))) (let ((.cse7 (+ c_main_~i~0 1)) (.cse13 (select .cse18 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (.cse19 (+ .cse12 2))) (let ((.cse5 (+ .cse12 4)) (.cse6 (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| .cse19)) c_main_~a~0.base)) (.cse8 (not (= 2 .cse13))) (.cse3 (+ c_main_~i~0 3)) (.cse9 (not (= 2 |c_main_#t~mem12|))) (.cse11 (+ .cse12 .cse13)) (.cse14 (< .cse7 c_~N~0)) (.cse4 (* c_~N~0 2))) (and (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse0 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse1 (select .cse0 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse1 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ .cse2 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 2 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse0 |c_main_~#sum~0.base| (store .cse1 |c_main_~#sum~0.offset| (+ 6 .cse2))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3) (< (* 2 v_main_~i~0_215) (+ 7 .cse2))))))) (or (= .cse4 .cse5) (forall ((v_main_~i~0_215 Int)) (or (not (= (select .cse6 (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_215))) .cse8) (or .cse9 (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_215) (not (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| .cse11)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))))))) (= .cse4 (+ .cse12 2 .cse13))) (or (= (+ .cse12 6) .cse4) (forall ((v_main_~i~0_216 Int) (v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_216) (not (= 2 (select (select (store |c_#memory_int| |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| .cse5)) c_main_~a~0.base) (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))))) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (not (= 2 (select .cse6 (+ c_main_~a~0.offset (* 4 v_main_~i~0_216))))))) .cse8) (or (= .cse12 .cse4) .cse14) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse15 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse16 (select .cse15 |c_main_~#sum~0.base|))) (let ((.cse17 (select .cse16 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ .cse17 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ 2 .cse17))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse15 |c_main_~#sum~0.base| (store .cse16 |c_main_~#sum~0.offset| (+ 6 .cse17))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse3) (< .cse17 (+ (* c_main_~i~0 2) 1))))))) (or .cse9 (= .cse11 .cse4) .cse14) (or (forall ((v_main_~i~0_215 Int)) (or (< (+ v_main_~i~0_215 1) c_~N~0) (< .cse7 v_main_~i~0_215) (not (= (select .cse18 (+ c_main_~a~0.offset (* 4 v_main_~i~0_215))) 2)))) (= .cse19 .cse4))))))) is different from false [2023-03-30 22:35:03,174 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)) (.cse0 (select (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset)))) (let ((.cse1 (= 2 .cse0)) (.cse11 (<= .cse2 2)) (.cse6 (+ c_main_~i~0 3)) (.cse16 (* c_main_~i~0 2)) (.cse10 (+ c_main_~i~0 2)) (.cse12 (<= 2 .cse2))) (and (or (= .cse0 |c_main_#t~mem12|) .cse1) (or (< c_main_~i~0 c_~N~0) (= .cse2 (* c_~N~0 2))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse5 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 2 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ 6 .cse5))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse6) (< (* 2 v_main_~i~0_215) (+ 7 .cse5))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse7 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse8 (select .cse7 |c_main_~#sum~0.base|))) (let ((.cse9 (select .cse8 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ .cse9 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 2 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse7 |c_main_~#sum~0.base| (store .cse8 |c_main_~#sum~0.offset| (+ 6 .cse9))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse10) (< (* 2 v_main_~i~0_215) (+ 7 .cse9))))))) (= c_~N~0 4) (or (and .cse11 .cse12) (not .cse1)) .cse11 (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse13 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse14 (select .cse13 |c_main_~#sum~0.base|))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ .cse15 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 2 .cse15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (not (= (select (select (store .cse13 |c_main_~#sum~0.base| (store .cse14 |c_main_~#sum~0.offset| (+ 6 .cse15))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse6) (< .cse15 (+ .cse16 1))))))) (forall ((v_ArrVal_735 (Array Int Int)) (main_~a~0.offset Int) (v_main_~i~0_218 Int) (v_main_~i~0_216 Int) (v_main_~i~0_217 Int) (v_main_~i~0_215 Int)) (let ((.cse17 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_735))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.base|))) (let ((.cse19 (select .cse18 |c_main_~#sum~0.offset|))) (or (< (+ v_main_~i~0_217 1) v_main_~i~0_216) (not (= 2 (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ .cse19 4))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_216))))) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 2 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_217))) 2)) (< 0 v_main_~i~0_218) (< (+ .cse19 1) .cse16) (not (= (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 6 .cse19))) c_main_~a~0.base) (+ main_~a~0.offset (* 4 v_main_~i~0_215))) 2)) (not (= 2 (select v_ArrVal_735 (+ (* 4 v_main_~i~0_218) main_~a~0.offset)))) (< (+ v_main_~i~0_218 1) v_main_~i~0_217) (< (+ v_main_~i~0_216 1) v_main_~i~0_215) (< v_main_~i~0_215 .cse10)))))) .cse12))) is different from false [2023-03-30 22:35:05,379 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 [0]