/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:42:14,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:42:14,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:42:14,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:42:14,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:42:14,410 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:42:14,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:42:14,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:42:14,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:42:14,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:42:14,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:42:14,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:42:14,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:42:14,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:42:14,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:42:14,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:42:14,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:42:14,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:42:14,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:42:14,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:42:14,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:42:14,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:42:14,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:42:14,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:42:14,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:42:14,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:42:14,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:42:14,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:42:14,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:42:14,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:42:14,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:42:14,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:42:14,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:42:14,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:42:14,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:42:14,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:42:14,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:42:14,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:42:14,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:42:14,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:42:14,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:42:14,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:42:14,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:42:14,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:42:14,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:42:14,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:42:14,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:42:14,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:42:14,472 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:42:14,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:42:14,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:42:14,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:42:14,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:42:14,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:42:14,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:42:14,473 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:42:14,473 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:42:14,473 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:42:14,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:42:14,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:42:14,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:42:14,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:42:14,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:42:14,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:42:14,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:42:14,475 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:42:14,475 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:42:14,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:42:14,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:42:14,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:42:14,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:42:14,678 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:42:14,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2022-01-10 17:42:14,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25aba05e1/a208056cc6d34bd1963889e2a7792dea/FLAG21ad6ee47 [2022-01-10 17:42:15,061 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:42:15,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2022-01-10 17:42:15,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25aba05e1/a208056cc6d34bd1963889e2a7792dea/FLAG21ad6ee47 [2022-01-10 17:42:15,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25aba05e1/a208056cc6d34bd1963889e2a7792dea [2022-01-10 17:42:15,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:42:15,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:42:15,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:42:15,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:42:15,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:42:15,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5911ac69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15, skipping insertion in model container [2022-01-10 17:42:15,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:42:15,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:42:15,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i[293,306] [2022-01-10 17:42:15,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:42:15,689 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:42:15,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i[293,306] [2022-01-10 17:42:15,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:42:15,734 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:42:15,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15 WrapperNode [2022-01-10 17:42:15,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:42:15,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:42:15,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:42:15,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:42:15,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,778 INFO L137 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 138 [2022-01-10 17:42:15,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:42:15,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:42:15,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:42:15,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:42:15,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:42:15,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:42:15,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:42:15,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:42:15,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (1/1) ... [2022-01-10 17:42:15,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:42:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:15,842 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) [2022-01-10 17:42:15,849 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 [2022-01-10 17:42:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:42:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 17:42:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:42:15,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:42:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-01-10 17:42:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:42:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:42:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:42:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:42:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:42:15,922 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:42:15,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:42:16,178 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:42:16,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:42:16,182 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 17:42:16,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:42:16 BoogieIcfgContainer [2022-01-10 17:42:16,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:42:16,185 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:42:16,185 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:42:16,186 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:42:16,188 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:42:16" (1/1) ... [2022-01-10 17:42:16,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:42:16 BasicIcfg [2022-01-10 17:42:16,293 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:42:16,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:42:16,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:42:16,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:42:16,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:42:15" (1/4) ... [2022-01-10 17:42:16,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6113151a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:42:16, skipping insertion in model container [2022-01-10 17:42:16,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:15" (2/4) ... [2022-01-10 17:42:16,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6113151a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:42:16, skipping insertion in model container [2022-01-10 17:42:16,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:42:16" (3/4) ... [2022-01-10 17:42:16,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6113151a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:42:16, skipping insertion in model container [2022-01-10 17:42:16,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:42:16" (4/4) ... [2022-01-10 17:42:16,298 INFO L111 eAbstractionObserver]: Analyzing ICFG ex3_forlist.iTransformedIcfg [2022-01-10 17:42:16,301 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:42:16,301 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 17:42:16,328 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:42:16,332 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:42:16,332 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 17:42:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 17:42:16,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:16,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:16,344 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:16,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2019735446, now seen corresponding path program 1 times [2022-01-10 17:42:16,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:16,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877547958] [2022-01-10 17:42:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:16,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:16,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877547958] [2022-01-10 17:42:16,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877547958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:16,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:16,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:42:16,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85723860] [2022-01-10 17:42:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:16,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:42:16,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:42:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:42:16,493 INFO L87 Difference]: Start difference. First operand has 37 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:16,508 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-01-10 17:42:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:42:16,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 17:42:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:16,514 INFO L225 Difference]: With dead ends: 68 [2022-01-10 17:42:16,514 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 17:42:16,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:42:16,520 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:16,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 17:42:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 17:42:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-01-10 17:42:16,545 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 15 [2022-01-10 17:42:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:16,546 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-01-10 17:42:16,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-01-10 17:42:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 17:42:16,547 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:16,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:16,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:42:16,549 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:16,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:16,551 INFO L85 PathProgramCache]: Analyzing trace with hash -797195371, now seen corresponding path program 1 times [2022-01-10 17:42:16,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:16,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007758262] [2022-01-10 17:42:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:16,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:16,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:16,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007758262] [2022-01-10 17:42:16,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007758262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:16,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:16,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:42:16,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481155101] [2022-01-10 17:42:16,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:16,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:42:16,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:16,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:42:16,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:16,762 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:16,794 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-01-10 17:42:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:42:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 17:42:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:16,797 INFO L225 Difference]: With dead ends: 60 [2022-01-10 17:42:16,797 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 17:42:16,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:16,801 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:16,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 17:42:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-10 17:42:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-01-10 17:42:16,805 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2022-01-10 17:42:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:16,806 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-01-10 17:42:16,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-01-10 17:42:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 17:42:16,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:16,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:16,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:42:16,807 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1242961229, now seen corresponding path program 1 times [2022-01-10 17:42:16,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548400375] [2022-01-10 17:42:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:16,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:42:16,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:16,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548400375] [2022-01-10 17:42:16,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548400375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:16,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:16,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:42:16,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255325056] [2022-01-10 17:42:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:16,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:42:16,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:16,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:42:16,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:16,942 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:16,998 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-01-10 17:42:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:42:17,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 17:42:17,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:17,001 INFO L225 Difference]: With dead ends: 75 [2022-01-10 17:42:17,001 INFO L226 Difference]: Without dead ends: 55 [2022-01-10 17:42:17,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:17,006 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:17,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 62 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-10 17:42:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2022-01-10 17:42:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 17:42:17,016 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 17 [2022-01-10 17:42:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:17,017 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 17:42:17,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 17:42:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 17:42:17,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:17,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:17,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:42:17,018 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1527673332, now seen corresponding path program 1 times [2022-01-10 17:42:17,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:17,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727190185] [2022-01-10 17:42:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:17,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:17,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:17,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727190185] [2022-01-10 17:42:17,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727190185] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:17,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353643517] [2022-01-10 17:42:17,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:17,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:17,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:17,170 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) [2022-01-10 17:42:17,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:42:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:17,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 17:42:17,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:17,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:17,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353643517] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:17,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:17,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 17:42:17,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659605472] [2022-01-10 17:42:17,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:17,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:42:17,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:17,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:42:17,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:42:17,859 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:17,903 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-01-10 17:42:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:42:17,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 17:42:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:17,906 INFO L225 Difference]: With dead ends: 66 [2022-01-10 17:42:17,906 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 17:42:17,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:42:17,907 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:17,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:17,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 17:42:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-01-10 17:42:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-01-10 17:42:17,910 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2022-01-10 17:42:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:17,910 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-01-10 17:42:17,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-01-10 17:42:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 17:42:17,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:17,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:17,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:18,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:18,121 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 12048914, now seen corresponding path program 2 times [2022-01-10 17:42:18,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937273126] [2022-01-10 17:42:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:18,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:22,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:22,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937273126] [2022-01-10 17:42:22,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937273126] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:22,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387746800] [2022-01-10 17:42:22,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:42:22,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:22,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:22,293 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) [2022-01-10 17:42:22,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:42:22,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 17:42:22,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:42:22,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-10 17:42:22,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:22,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 43 [2022-01-10 17:42:22,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:22,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 39 [2022-01-10 17:42:23,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:23,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 7 [2022-01-10 17:42:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 17:42:23,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:42:23,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387746800] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:23,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:42:23,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 24 [2022-01-10 17:42:23,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917355506] [2022-01-10 17:42:23,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:23,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 17:42:23,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 17:42:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-01-10 17:42:23,137 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:23,421 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-01-10 17:42:23,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:42:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 17:42:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:23,422 INFO L225 Difference]: With dead ends: 57 [2022-01-10 17:42:23,422 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 17:42:23,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2022-01-10 17:42:23,423 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:23,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 168 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-01-10 17:42:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 17:42:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-01-10 17:42:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-01-10 17:42:23,429 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2022-01-10 17:42:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:23,429 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-01-10 17:42:23,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-01-10 17:42:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 17:42:23,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:23,430 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:23,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:23,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:23,637 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:23,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1230273882, now seen corresponding path program 1 times [2022-01-10 17:42:23,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:23,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021939039] [2022-01-10 17:42:23,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:23,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 17:42:23,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:23,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021939039] [2022-01-10 17:42:23,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021939039] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:23,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188112045] [2022-01-10 17:42:23,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:23,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:23,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:23,737 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) [2022-01-10 17:42:23,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:42:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:23,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 17:42:23,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:23,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 17:42:24,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188112045] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:24,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:24,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 8 [2022-01-10 17:42:24,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821742632] [2022-01-10 17:42:24,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:24,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 17:42:24,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:24,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 17:42:24,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 17:42:24,033 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:24,166 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-01-10 17:42:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:42:24,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 17:42:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:24,169 INFO L225 Difference]: With dead ends: 121 [2022-01-10 17:42:24,170 INFO L226 Difference]: Without dead ends: 100 [2022-01-10 17:42:24,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 17:42:24,170 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 145 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:24,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 228 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:42:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-10 17:42:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 45. [2022-01-10 17:42:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-01-10 17:42:24,175 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2022-01-10 17:42:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:24,176 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-01-10 17:42:24,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-01-10 17:42:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:42:24,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:24,176 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:24,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:24,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:24,377 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash 395204752, now seen corresponding path program 1 times [2022-01-10 17:42:24,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:24,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855635232] [2022-01-10 17:42:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:24,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:42:25,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855635232] [2022-01-10 17:42:25,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855635232] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:25,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688193992] [2022-01-10 17:42:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:25,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:25,618 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) [2022-01-10 17:42:25,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:42:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:26,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 17:42:26,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:26,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 23 [2022-01-10 17:42:26,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:26,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:26,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 39 [2022-01-10 17:42:26,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:26,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 38 [2022-01-10 17:42:26,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:26,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2022-01-10 17:42:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:26,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:26,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 Int) (v_ArrVal_471 (Array Int Int))) (= (select (store (select (store |c_#memory_intInt| |c_~#pp~0.baseInt| v_ArrVal_471) |c_~#pstate~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744056529682432) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 4)) 18446744073709551616) |c_~#pstate~0.offsetInt|) 18446744073709551616) v_ArrVal_470) (+ |c_~#pstate~0.offsetInt| (* (div |c_~#pstate~0.offsetInt| 18446744073709551616) (- 18446744073709551616)))) 1)) is different from false [2022-01-10 17:42:27,016 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 Int) (v_ArrVal_471 (Array Int Int))) (= (select (store (select (store |c_#memory_intInt| |c_~#pp~0.baseInt| v_ArrVal_471) |c_~#pstate~0.baseInt|) (mod (+ |c_~#pstate~0.offsetInt| (mod (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 1) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) v_ArrVal_470) (+ |c_~#pstate~0.offsetInt| (* (div |c_~#pstate~0.offsetInt| 18446744073709551616) (- 18446744073709551616)))) 1)) is different from false [2022-01-10 17:42:27,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 Int) (v_ArrVal_471 (Array Int Int))) (= (select (store (select (store |c_#memory_intInt| |c_~#pp~0.baseInt| v_ArrVal_471) |c_~#pstate~0.baseInt|) (mod (+ |c_~#pstate~0.offsetInt| 4) 18446744073709551616) v_ArrVal_470) (+ |c_~#pstate~0.offsetInt| (* (div |c_~#pstate~0.offsetInt| 18446744073709551616) (- 18446744073709551616)))) 1)) is different from false [2022-01-10 17:42:27,059 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:27,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 48 [2022-01-10 17:42:27,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 68 [2022-01-10 17:42:27,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:27,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-01-10 17:42:27,089 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:27,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 72 treesize of output 76 [2022-01-10 17:42:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 17:42:27,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688193992] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:27,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:27,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2022-01-10 17:42:27,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388395888] [2022-01-10 17:42:27,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:27,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-10 17:42:27,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-10 17:42:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=611, Unknown=3, NotChecked=162, Total=930 [2022-01-10 17:42:27,300 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:29,275 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-01-10 17:42:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 17:42:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 17:42:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:29,277 INFO L225 Difference]: With dead ends: 62 [2022-01-10 17:42:29,277 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 17:42:29,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=423, Invalid=1566, Unknown=3, NotChecked=264, Total=2256 [2022-01-10 17:42:29,279 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:29,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 289 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 189 Invalid, 0 Unknown, 156 Unchecked, 0.6s Time] [2022-01-10 17:42:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 17:42:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2022-01-10 17:42:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-01-10 17:42:29,285 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 24 [2022-01-10 17:42:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:29,285 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-01-10 17:42:29,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-01-10 17:42:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:42:29,286 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:29,286 INFO L514 BasicCegarLoop]: 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] [2022-01-10 17:42:29,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:29,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:29,492 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:29,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1805035091, now seen corresponding path program 1 times [2022-01-10 17:42:29,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:29,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488557663] [2022-01-10 17:42:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:29,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 17:42:29,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:29,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488557663] [2022-01-10 17:42:29,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488557663] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:29,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:29,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:42:29,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93194080] [2022-01-10 17:42:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:29,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:42:29,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:29,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:42:29,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:29,586 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:29,610 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-01-10 17:42:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:42:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 17:42:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:29,611 INFO L225 Difference]: With dead ends: 72 [2022-01-10 17:42:29,612 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 17:42:29,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:29,612 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:29,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 59 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 17:42:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-01-10 17:42:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-01-10 17:42:29,625 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 26 [2022-01-10 17:42:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:29,626 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-01-10 17:42:29,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-01-10 17:42:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:42:29,627 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:29,628 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:29,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 17:42:29,628 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 75846744, now seen corresponding path program 2 times [2022-01-10 17:42:29,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37236185] [2022-01-10 17:42:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:29,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 17:42:30,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:30,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37236185] [2022-01-10 17:42:30,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37236185] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:30,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019910517] [2022-01-10 17:42:30,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:42:30,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:30,990 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) [2022-01-10 17:42:30,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:42:31,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 17:42:31,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:42:31,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 17:42:31,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:31,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 23 [2022-01-10 17:42:31,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:31,417 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:31,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 10 [2022-01-10 17:42:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 17:42:31,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:42:31,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019910517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:31,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:42:31,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-01-10 17:42:31,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483387040] [2022-01-10 17:42:31,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:31,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 17:42:31,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:31,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 17:42:31,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-01-10 17:42:31,438 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:31,564 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-01-10 17:42:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:42:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 17:42:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:31,566 INFO L225 Difference]: With dead ends: 104 [2022-01-10 17:42:31,566 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 17:42:31,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-01-10 17:42:31,567 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 83 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:31,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 175 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-01-10 17:42:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 17:42:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-01-10 17:42:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.309090909090909) internal successors, (72), 56 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-01-10 17:42:31,573 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 26 [2022-01-10 17:42:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:31,573 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-01-10 17:42:31,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-01-10 17:42:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 17:42:31,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:31,574 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:31,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-10 17:42:31,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:31,779 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1068673381, now seen corresponding path program 1 times [2022-01-10 17:42:31,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:31,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665099591] [2022-01-10 17:42:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:31,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:33,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:33,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665099591] [2022-01-10 17:42:33,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665099591] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:33,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690770740] [2022-01-10 17:42:33,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:33,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:33,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:33,432 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) [2022-01-10 17:42:33,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 17:42:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:33,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 17:42:33,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:34,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:42:34,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-01-10 17:42:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:34,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:34,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 28 [2022-01-10 17:42:34,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 52 [2022-01-10 17:42:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 17:42:34,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690770740] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:34,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:34,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 8] total 34 [2022-01-10 17:42:34,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595942268] [2022-01-10 17:42:34,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:34,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 17:42:34,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:34,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 17:42:34,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 17:42:34,639 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:41,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 17:42:50,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 17:42:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:50,990 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2022-01-10 17:42:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-10 17:42:50,991 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 17:42:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:50,992 INFO L225 Difference]: With dead ends: 159 [2022-01-10 17:42:50,992 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 17:42:50,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=566, Invalid=3593, Unknown=1, NotChecked=0, Total=4160 [2022-01-10 17:42:50,993 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 320 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 161 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:50,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 515 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1005 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-01-10 17:42:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 17:42:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 69. [2022-01-10 17:42:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 68 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2022-01-10 17:42:51,001 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 27 [2022-01-10 17:42:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:51,002 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2022-01-10 17:42:51,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-01-10 17:42:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 17:42:51,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:51,002 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:51,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:51,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:51,209 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:51,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1032298158, now seen corresponding path program 2 times [2022-01-10 17:42:51,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:51,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481138756] [2022-01-10 17:42:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:51,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 17:42:51,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:51,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481138756] [2022-01-10 17:42:51,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481138756] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:51,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928815813] [2022-01-10 17:42:51,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:42:51,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:51,290 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) [2022-01-10 17:42:51,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 17:42:51,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 17:42:51,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:42:51,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 17:42:51,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:51,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 23 [2022-01-10 17:42:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:51,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:51,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 51 [2022-01-10 17:42:51,901 INFO L353 Elim1Store]: treesize reduction 97, result has 19.2 percent of original size [2022-01-10 17:42:51,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2022-01-10 17:42:51,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:51,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2022-01-10 17:42:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 17:42:52,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:42:52,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928815813] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:52,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:42:52,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-01-10 17:42:52,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124135653] [2022-01-10 17:42:52,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:52,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 17:42:52,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 17:42:52,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-01-10 17:42:52,004 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:52,077 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-01-10 17:42:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:42:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 17:42:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:52,079 INFO L225 Difference]: With dead ends: 75 [2022-01-10 17:42:52,079 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 17:42:52,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-10 17:42:52,080 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:52,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2022-01-10 17:42:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 17:42:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-01-10 17:42:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 66 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-01-10 17:42:52,089 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 27 [2022-01-10 17:42:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:52,089 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-01-10 17:42:52,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-01-10 17:42:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 17:42:52,089 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:52,089 INFO L514 BasicCegarLoop]: 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] [2022-01-10 17:42:52,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:52,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:52,294 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:52,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash -960909416, now seen corresponding path program 1 times [2022-01-10 17:42:52,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:52,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840988898] [2022-01-10 17:42:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:52,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:42:57,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:57,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840988898] [2022-01-10 17:42:57,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840988898] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:57,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064768655] [2022-01-10 17:42:57,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:57,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:57,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:57,497 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) [2022-01-10 17:42:57,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 17:42:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:58,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 88 conjunts are in the unsatisfiable core [2022-01-10 17:42:58,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:58,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 30 treesize of output 30 [2022-01-10 17:42:58,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:58,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-01-10 17:42:58,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 30 treesize of output 30 [2022-01-10 17:42:58,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:58,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2022-01-10 17:42:58,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:58,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 17:42:58,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:58,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-01-10 17:42:58,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:58,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 17:42:58,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:58,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-01-10 17:42:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:59,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:59,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:59,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-01-10 17:42:59,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:59,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:59,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:59,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-01-10 17:42:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:59,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 41 treesize of output 41 [2022-01-10 17:42:59,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:59,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 62 [2022-01-10 17:43:01,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:43:01,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:43:01,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 13 [2022-01-10 17:43:01,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 3 [2022-01-10 17:43:02,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:43:02,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 62 [2022-01-10 17:43:02,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:43:02,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 13 [2022-01-10 17:43:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:43:02,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:43:02,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ |c_~#pp~0.offsetInt| (mod (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_g_~i~2#1Int| 1) 4294967296))) (+ (* .cse0 8) (* 18446744039349813248 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_g_~pointer#1.offsetInt|))) is different from false [2022-01-10 17:43:02,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 4 [2022-01-10 17:43:02,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) is different from false [2022-01-10 17:43:03,007 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744039349813248) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_f_~pointer#1.baseInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744039349813248) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_f_~pointer#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744039349813248) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_f_~pointer#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 17:43:11,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| Int)) (or (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19|)) (not (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 0)))) is different from false [2022-01-10 17:43:19,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5| Int) (|v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.offsetInt| (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)))) (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5| |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.baseInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)))) is different from false [2022-01-10 17:43:23,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5| Int) (|v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| Int)) (or (< 0 |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19|)) (not (let ((.cse0 (+ (* 18446744069414584320 (mod (div c_~counter~0Int 2147483648) 2)) c_~counter~0Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) .cse0)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616))))) (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) (+ (* 18446744069414584320 (mod (div c_~counter~0Int 2147483648) 2)) c_~counter~0Int))) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)))) is different from false