/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_SUM.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:06:11,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:06:11,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:06:11,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:06:11,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:06:11,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:06:11,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:06:11,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:06:11,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:06:11,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:06:11,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:06:11,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:06:11,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:06:11,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:06:11,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:06:11,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:06:11,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:06:11,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:06:11,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:06:11,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:06:11,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:06:11,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:06:11,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:06:11,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:06:11,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:06:11,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:06:11,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:06:11,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:06:11,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:06:11,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:06:11,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:06:11,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:06:11,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:06:11,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:06:11,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:06:11,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:06:11,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:06:11,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:06:11,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:06:11,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:06:11,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:06:11,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:06:11,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:06:11,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:06:11,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:06:11,557 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:06:11,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:06:11,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:06:11,558 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:06:11,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:06:11,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:06:11,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:06:11,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:06:11,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:06:11,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:06:11,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:06:11,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:06:11,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:06:11,561 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:06:11,561 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 03:06:11,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:06:11,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:06:11,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:06:11,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:06:11,757 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:06:11,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c [2022-01-11 03:06:11,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129ff0b74/d4d07eecd0df4a6babfd4354f0df92e1/FLAG31da26588 [2022-01-11 03:06:12,157 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:06:12,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c [2022-01-11 03:06:12,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129ff0b74/d4d07eecd0df4a6babfd4354f0df92e1/FLAG31da26588 [2022-01-11 03:06:12,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129ff0b74/d4d07eecd0df4a6babfd4354f0df92e1 [2022-01-11 03:06:12,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:06:12,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:06:12,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:06:12,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:06:12,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:06:12,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46aacc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12, skipping insertion in model container [2022-01-11 03:06:12,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:06:12,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:06:12,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c[432,445] [2022-01-11 03:06:12,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:06:12,745 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:06:12,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c[432,445] [2022-01-11 03:06:12,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:06:12,768 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:06:12,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12 WrapperNode [2022-01-11 03:06:12,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:06:12,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:06:12,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:06:12,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:06:12,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,801 INFO L137 Inliner]: procedures = 18, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2022-01-11 03:06:12,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:06:12,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:06:12,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:06:12,802 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:06:12,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:06:12,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:06:12,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:06:12,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:06:12,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (1/1) ... [2022-01-11 03:06:12,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:06:12,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:06:12,851 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-11 03:06:12,855 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-11 03:06:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:06:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:06:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 03:06:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 03:06:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:06:12,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:06:12,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 03:06:12,936 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:06:12,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:06:13,069 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:06:13,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:06:13,073 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-11 03:06:13,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:06:13 BoogieIcfgContainer [2022-01-11 03:06:13,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:06:13,075 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:06:13,075 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:06:13,076 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:06:13,078 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:06:13" (1/1) ... [2022-01-11 03:06:13,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:06:13 BasicIcfg [2022-01-11 03:06:13,178 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:06:13,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:06:13,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:06:13,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:06:13,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:06:12" (1/4) ... [2022-01-11 03:06:13,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5a0c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:06:13, skipping insertion in model container [2022-01-11 03:06:13,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:06:12" (2/4) ... [2022-01-11 03:06:13,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5a0c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:06:13, skipping insertion in model container [2022-01-11 03:06:13,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:06:13" (3/4) ... [2022-01-11 03:06:13,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5a0c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:06:13, skipping insertion in model container [2022-01-11 03:06:13,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:06:13" (4/4) ... [2022-01-11 03:06:13,183 INFO L111 eAbstractionObserver]: Analyzing ICFG revcpyswp2.cTransformedIcfg [2022-01-11 03:06:13,186 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:06:13,186 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:06:13,234 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:06:13,241 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-11 03:06:13,242 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:06:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-11 03:06:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 03:06:13,280 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:06:13,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:06:13,281 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:06:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:06:13,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1625221935, now seen corresponding path program 1 times [2022-01-11 03:06:13,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:06:13,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059807295] [2022-01-11 03:06:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:06:13,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:06:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:06:13,488 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-11 03:06:13,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:06:13,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059807295] [2022-01-11 03:06:13,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059807295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:06:13,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:06:13,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 03:06:13,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975323626] [2022-01-11 03:06:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:06:13,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 03:06:13,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:06:13,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 03:06:13,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 03:06:13,521 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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.0) internal successors, (14), 2 states have internal predecessors, (14), 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-11 03:06:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:06:13,543 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-01-11 03:06:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 03:06:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-01-11 03:06:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:06:13,552 INFO L225 Difference]: With dead ends: 45 [2022-01-11 03:06:13,552 INFO L226 Difference]: Without dead ends: 21 [2022-01-11 03:06:13,555 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-11 03:06:13,559 INFO L933 BasicCegarLoop]: 30 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, 30 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-11 03:06:13,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:06:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-11 03:06:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-11 03:06:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-11 03:06:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-11 03:06:13,592 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-01-11 03:06:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:06:13,592 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-11 03:06:13,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-11 03:06:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-11 03:06:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 03:06:13,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:06:13,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:06:13,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:06:13,593 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:06:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:06:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash -46233259, now seen corresponding path program 1 times [2022-01-11 03:06:13,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:06:13,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872758477] [2022-01-11 03:06:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:06:13,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:06:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:06:13,794 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-11 03:06:13,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:06:13,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872758477] [2022-01-11 03:06:13,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872758477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:06:13,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:06:13,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:06:13,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629541708] [2022-01-11 03:06:13,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:06:13,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:06:13,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:06:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:06:13,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:06:13,796 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 03:06:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:06:13,880 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-01-11 03:06:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:06:13,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-01-11 03:06:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:06:13,881 INFO L225 Difference]: With dead ends: 39 [2022-01-11 03:06:13,881 INFO L226 Difference]: Without dead ends: 23 [2022-01-11 03:06:13,881 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-11 03:06:13,882 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 03:06:13,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 03:06:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-11 03:06:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-01-11 03:06:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-11 03:06:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-01-11 03:06:13,886 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-01-11 03:06:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:06:13,886 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-01-11 03:06:13,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 03:06:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-01-11 03:06:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 03:06:13,887 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:06:13,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:06:13,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:06:13,887 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:06:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:06:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1263832114, now seen corresponding path program 1 times [2022-01-11 03:06:13,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:06:13,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848194372] [2022-01-11 03:06:13,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:06:13,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:06:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:06:14,065 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-11 03:06:14,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:06:14,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848194372] [2022-01-11 03:06:14,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848194372] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:06:14,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539931863] [2022-01-11 03:06:14,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:06:14,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:06:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:06:14,091 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-11 03:06:14,121 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-11 03:06:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:06:14,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-11 03:06:14,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:06:14,286 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-11 03:06:14,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:06:14,403 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-11 03:06:14,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539931863] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:06:14,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:06:14,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-01-11 03:06:14,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234312408] [2022-01-11 03:06:14,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:06:14,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 03:06:14,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:06:14,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 03:06:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-11 03:06:14,409 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-11 03:06:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:06:14,713 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-01-11 03:06:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 03:06:14,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 16 [2022-01-11 03:06:14,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:06:14,714 INFO L225 Difference]: With dead ends: 65 [2022-01-11 03:06:14,715 INFO L226 Difference]: Without dead ends: 49 [2022-01-11 03:06:14,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-01-11 03:06:14,716 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 03:06:14,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 25 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 03:06:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-11 03:06:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-01-11 03:06:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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-11 03:06:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-11 03:06:14,724 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-01-11 03:06:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:06:14,725 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-11 03:06:14,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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-11 03:06:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-11 03:06:14,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:06:14,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:06:14,726 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, 1] [2022-01-11 03:06:14,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 03:06:14,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:06:14,946 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:06:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:06:14,947 INFO L85 PathProgramCache]: Analyzing trace with hash 774521960, now seen corresponding path program 1 times [2022-01-11 03:06:14,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:06:14,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702757236] [2022-01-11 03:06:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:06:14,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:06:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:06:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 03:06:15,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:06:15,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702757236] [2022-01-11 03:06:15,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702757236] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:06:15,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123222957] [2022-01-11 03:06:15,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:06:15,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:06:15,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:06:15,262 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-11 03:06:15,263 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-11 03:06:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:06:15,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 03:06:15,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:06:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 03:06:15,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:06:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 03:06:15,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123222957] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 03:06:15,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 03:06:15,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2022-01-11 03:06:15,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830095641] [2022-01-11 03:06:15,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 03:06:15,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-11 03:06:15,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:06:15,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-11 03:06:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-11 03:06:15,634 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-11 03:06:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:06:16,108 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-01-11 03:06:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 03:06:16,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-11 03:06:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:06:16,110 INFO L225 Difference]: With dead ends: 73 [2022-01-11 03:06:16,110 INFO L226 Difference]: Without dead ends: 58 [2022-01-11 03:06:16,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-11 03:06:16,111 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 03:06:16,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 39 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 03:06:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-11 03:06:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2022-01-11 03:06:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-11 03:06:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-11 03:06:16,119 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2022-01-11 03:06:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:06:16,119 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-11 03:06:16,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-11 03:06:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-11 03:06:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 03:06:16,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:06:16,120 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:06:16,137 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-11 03:06:16,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-11 03:06:16,335 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:06:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:06:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2101268799, now seen corresponding path program 2 times [2022-01-11 03:06:16,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:06:16,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191789959] [2022-01-11 03:06:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:06:16,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:06:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:06:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:06:32,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:06:32,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191789959] [2022-01-11 03:06:32,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191789959] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 03:06:32,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749072087] [2022-01-11 03:06:32,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 03:06:32,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 03:06:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:06:32,315 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-11 03:06:32,316 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-11 03:06:34,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 03:06:34,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 03:06:34,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 95 conjunts are in the unsatisfiable core [2022-01-11 03:06:34,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 03:06:34,279 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 03:06:34,280 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 78 treesize of output 68 [2022-01-11 03:06:34,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2022-01-11 03:06:34,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 73 [2022-01-11 03:06:35,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 03:06:35,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 03:06:35,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 92 [2022-01-11 03:06:35,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 84 [2022-01-11 03:06:37,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 03:06:37,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2022-01-11 03:06:37,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 03:06:37,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 03:06:37,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 115 treesize of output 87 [2022-01-11 03:06:37,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 51 [2022-01-11 03:06:37,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 03:06:37,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 113 [2022-01-11 03:06:39,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 87 [2022-01-11 03:06:39,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 102 [2022-01-11 03:06:39,885 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 41 treesize of output 23 [2022-01-11 03:06:40,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 03:06:40,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 68 [2022-01-11 03:06:40,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2022-01-11 03:06:40,371 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 13 treesize of output 11 [2022-01-11 03:06:44,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 03:06:44,175 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 03:06:44,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 20 [2022-01-11 03:06:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:06:44,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 03:06:46,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| Int) (v_ArrVal_331 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse2 (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616))) (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616) (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse2) 18446744073709551616))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_331))) (= (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (+ (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 4) (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 2147483648) 2) 18446744056529682432)) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616)) (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ c_~SIZE~0Int (mod (* 4294967295 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|) 4294967296) 4294967295) 4294967296))) (+ (* 4 .cse1) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.offsetInt|) 18446744073709551616)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|)))) is different from false [2022-01-11 03:06:46,763 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| Int) (v_ArrVal_331 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse2 (mod (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296))) (+ (* 18446744056529682432 (mod (div .cse3 2147483648) 2)) (* 4 .cse3))) 18446744073709551616))) (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616) (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse2) 18446744073709551616))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_331))) (= (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ c_~SIZE~0Int (mod (* 4294967295 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|) 4294967296) 4294967295) 4294967296))) (+ (* 4 .cse1) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.offsetInt|) 18446744073709551616)) (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (+ (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 4) (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 2147483648) 2) 18446744056529682432)) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|)))) is different from false [2022-01-11 03:06:47,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse2 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse5 (mod (+ (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4) (* 18446744056529682432 (mod (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648) 2))) 18446744073709551616))) (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616) (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_330))) (store .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse3 (mod (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296))) (+ (* 18446744056529682432 (mod (div .cse4 2147483648) 2)) (* 4 .cse4))) 18446744073709551616))) (store (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616) (select v_ArrVal_330 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse3) 18446744073709551616)))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_331))) (= (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ c_~SIZE~0Int (mod (* 4294967295 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|) 4294967296) 4294967295) 4294967296))) (+ (* 4 .cse1) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.offsetInt|) 18446744073709551616)) (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (+ (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 4) (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 2147483648) 2) 18446744056529682432)) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|)))) is different from false [2022-01-11 03:06:47,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| Int)) (or (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse2 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse5 (mod (+ (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 4) (* 18446744056529682432 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 2147483648) 2))) 18446744073709551616))) (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616) (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_330))) (store .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse3 (mod (let ((.cse4 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 1) 4294967296))) (+ (* 18446744056529682432 (mod (div .cse4 2147483648) 2)) (* .cse4 4))) 18446744073709551616))) (store (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| .cse3) 18446744073709551616) (select v_ArrVal_330 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse3) 18446744073709551616)))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_331))) (= (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ c_~SIZE~0Int (mod (* 4294967295 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|) 4294967296) 4294967295) 4294967296))) (+ (* 4 .cse1) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.offsetInt|) 18446744073709551616)) (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (+ (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 4) (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 2147483648) 2) 18446744056529682432)) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28|)))) is different from false [2022-01-11 03:06:49,196 WARN L838 $PredicateComparison]: unable to prove that (or (<= (div (+ (- 2147483648) (* 2 (mod c_~SIZE~0Int 2147483648)) (* (- 1) c_~SIZE~0Int)) (- 2147483648)) (+ (div (+ (- 2147483648) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 2147483648) 1)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_330 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse2 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse5 (mod (+ (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 4) (* 18446744056529682432 (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 2147483648) 2))) 18446744073709551616))) (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616) (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_330))) (store .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| (let ((.cse3 (mod (let ((.cse4 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 1) 4294967296))) (+ (* 18446744056529682432 (mod (div .cse4 2147483648) 2)) (* .cse4 4))) 18446744073709551616))) (store (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| .cse3) 18446744073709551616) (select v_ArrVal_330 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse3) 18446744073709551616)))))) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| v_ArrVal_331))) (= (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ c_~SIZE~0Int (mod (* 4294967295 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|) 4294967296) 4294967295) 4294967296))) (+ (* 4 .cse1) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a_copy~0#1.offsetInt|) 18446744073709551616)) (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (+ (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 4) (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 2147483648) 2) 18446744056529682432)) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 18446744073709551616)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28| 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_28|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_25|))))) is different from false