/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_BITWISE.epf -i ../../../trunk/examples/svcomp/array-fpi/eqn4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 09:53:44,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 09:53:44,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 09:53:44,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 09:53:44,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 09:53:44,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 09:53:44,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 09:53:44,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 09:53:44,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 09:53:44,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 09:53:44,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 09:53:44,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 09:53:44,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 09:53:44,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 09:53:44,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 09:53:44,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 09:53:44,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 09:53:44,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 09:53:44,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 09:53:44,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 09:53:44,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 09:53:44,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 09:53:44,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 09:53:44,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 09:53:44,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 09:53:44,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 09:53:44,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 09:53:44,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 09:53:44,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 09:53:44,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 09:53:44,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 09:53:44,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 09:53:44,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 09:53:44,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 09:53:44,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 09:53:44,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 09:53:44,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 09:53:44,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 09:53:44,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 09:53:44,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 09:53:44,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 09:53:44,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 09:53:44,749 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 09:53:44,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 09:53:44,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 09:53:44,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 09:53:44,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 09:53:44,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 09:53:44,752 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 09:53:44,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 09:53:44,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 09:53:44,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 09:53:44,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 09:53:44,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 09:53:44,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 09:53:44,753 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 09:53:44,753 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 09:53:44,753 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 09:53:44,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 09:53:44,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 09:53:44,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 09:53:44,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 09:53:44,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 09:53:44,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 09:53:44,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 09:53:44,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 09:53:44,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 09:53:44,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 09:53:44,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 09:53:44,756 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 09:53:44,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 09:53:44,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 09:53:44,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 09:53:44,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 09:53:44,757 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 09:53:44,757 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 09:53:45,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 09:53:45,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 09:53:45,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 09:53:45,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 09:53:45,029 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 09:53:45,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/eqn4.c [2022-01-10 09:53:45,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813d65623/2199926c134f4eb1b6adcd584efb29f9/FLAG1f29d3ad0 [2022-01-10 09:53:45,465 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 09:53:45,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/eqn4.c [2022-01-10 09:53:45,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813d65623/2199926c134f4eb1b6adcd584efb29f9/FLAG1f29d3ad0 [2022-01-10 09:53:45,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/813d65623/2199926c134f4eb1b6adcd584efb29f9 [2022-01-10 09:53:45,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 09:53:45,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 09:53:45,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 09:53:45,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 09:53:45,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 09:53:45,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29082b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45, skipping insertion in model container [2022-01-10 09:53:45,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 09:53:45,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 09:53:45,708 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-fpi/eqn4.c[587,600] [2022-01-10 09:53:45,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 09:53:45,751 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 09:53:45,766 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-fpi/eqn4.c[587,600] [2022-01-10 09:53:45,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 09:53:45,798 INFO L208 MainTranslator]: Completed translation [2022-01-10 09:53:45,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45 WrapperNode [2022-01-10 09:53:45,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 09:53:45,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 09:53:45,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 09:53:45,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 09:53:45,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,842 INFO L137 Inliner]: procedures = 18, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-01-10 09:53:45,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 09:53:45,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 09:53:45,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 09:53:45,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 09:53:45,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 09:53:45,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 09:53:45,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 09:53:45,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 09:53:45,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (1/1) ... [2022-01-10 09:53:45,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 09:53:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:45,912 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 09:53:45,942 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 09:53:45,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 09:53:45,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 09:53:45,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-01-10 09:53:45,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 09:53:45,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 09:53:45,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 09:53:45,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-01-10 09:53:46,018 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 09:53:46,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 09:53:46,295 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 09:53:46,299 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 09:53:46,300 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 09:53:46,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:53:46 BoogieIcfgContainer [2022-01-10 09:53:46,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 09:53:46,302 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 09:53:46,302 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 09:53:46,303 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 09:53:46,306 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:53:46" (1/1) ... [2022-01-10 09:53:46,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:53:46 BasicIcfg [2022-01-10 09:53:46,421 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 09:53:46,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 09:53:46,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 09:53:46,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 09:53:46,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:53:45" (1/4) ... [2022-01-10 09:53:46,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201fc581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:53:46, skipping insertion in model container [2022-01-10 09:53:46,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:53:45" (2/4) ... [2022-01-10 09:53:46,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201fc581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:53:46, skipping insertion in model container [2022-01-10 09:53:46,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:53:46" (3/4) ... [2022-01-10 09:53:46,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201fc581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:53:46, skipping insertion in model container [2022-01-10 09:53:46,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:53:46" (4/4) ... [2022-01-10 09:53:46,427 INFO L111 eAbstractionObserver]: Analyzing ICFG eqn4.cTransformedIcfg [2022-01-10 09:53:46,431 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 09:53:46,431 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 09:53:46,466 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 09:53:46,472 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 09:53:46,472 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 09:53:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 09:53:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 09:53:46,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:46,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:46,488 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 751161390, now seen corresponding path program 1 times [2022-01-10 09:53:46,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952220247] [2022-01-10 09:53:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:46,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:46,653 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 09:53:46,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:46,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952220247] [2022-01-10 09:53:46,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952220247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:53:46,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:53:46,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 09:53:46,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583622293] [2022-01-10 09:53:46,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:53:46,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 09:53:46,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 09:53:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 09:53:46,691 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 09:53:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:53:46,703 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-01-10 09:53:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 09:53:46,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-01-10 09:53:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:53:46,710 INFO L225 Difference]: With dead ends: 38 [2022-01-10 09:53:46,710 INFO L226 Difference]: Without dead ends: 17 [2022-01-10 09:53:46,713 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 09:53:46,716 INFO L933 BasicCegarLoop]: 24 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, 24 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 09:53:46,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 09:53:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-10 09:53:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-10 09:53:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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 09:53:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-01-10 09:53:46,741 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-01-10 09:53:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:53:46,742 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-01-10 09:53:46,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 09:53:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-01-10 09:53:46,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 09:53:46,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:46,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:46,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 09:53:46,743 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1055369552, now seen corresponding path program 1 times [2022-01-10 09:53:46,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:46,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461359622] [2022-01-10 09:53:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:46,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:46,792 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:53:46,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057258236] [2022-01-10 09:53:46,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:46,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:46,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:46,803 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 09:53:46,847 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 09:53:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:47,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 09:53:47,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:53:47,142 INFO L353 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-01-10 09:53:47,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 81 [2022-01-10 09:53:47,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:47,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 09:53:47,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:47,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:47,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 09:53:47,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:47,433 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 27 treesize of output 15 [2022-01-10 09:53:47,522 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 34 treesize of output 28 [2022-01-10 09:53:47,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:47,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 15 [2022-01-10 09:53:47,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:53:47,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:53:47,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:53:47,752 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 09:53:47,752 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 79 [2022-01-10 09:53:47,788 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 09:53:47,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 09:53:47,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:47,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461359622] [2022-01-10 09:53:47,789 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:53:47,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057258236] [2022-01-10 09:53:47,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057258236] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:53:47,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:53:47,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 09:53:47,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020198307] [2022-01-10 09:53:47,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:53:47,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 09:53:47,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:47,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 09:53:47,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 09:53:47,793 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 09:53:49,928 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 09:53:52,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:53:54,746 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:53:57,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-01-10 09:53:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:53:57,730 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-01-10 09:53:57,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 09:53:57,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-01-10 09:53:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:53:57,734 INFO L225 Difference]: With dead ends: 34 [2022-01-10 09:53:57,734 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 09:53:57,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 09:53:57,736 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-01-10 09:53:57,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 53 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 4 Unknown, 0 Unchecked, 9.9s Time] [2022-01-10 09:53:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 09:53:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-01-10 09:53:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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 09:53:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-10 09:53:57,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-01-10 09:53:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:53:57,743 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-10 09:53:57,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 09:53:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-10 09:53:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 09:53:57,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:53:57,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:53:57,750 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-10 09:53:57,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:57,948 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:53:57,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:53:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash 312554478, now seen corresponding path program 1 times [2022-01-10 09:53:57,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:53:57,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169917251] [2022-01-10 09:53:57,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:57,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:53:58,007 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:53:58,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152691987] [2022-01-10 09:53:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:53:58,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:53:58,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:53:58,009 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 09:53:58,039 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 09:53:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:53:58,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 09:53:58,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:53:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:53:58,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 09:53:58,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:53:58,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169917251] [2022-01-10 09:53:58,187 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:53:58,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152691987] [2022-01-10 09:53:58,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152691987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 09:53:58,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 09:53:58,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 09:53:58,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62398416] [2022-01-10 09:53:58,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 09:53:58,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 09:53:58,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:53:58,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 09:53:58,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 09:53:58,196 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-10 09:54:00,283 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 09:54:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:54:00,618 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-01-10 09:54:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 09:54:00,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-10 09:54:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:54:00,620 INFO L225 Difference]: With dead ends: 41 [2022-01-10 09:54:00,621 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 09:54:00,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 09:54:00,622 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-01-10 09:54:00,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-01-10 09:54:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 09:54:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-01-10 09:54:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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-10 09:54:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-01-10 09:54:00,627 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-01-10 09:54:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:54:00,627 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-01-10 09:54:00,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-10 09:54:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-01-10 09:54:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 09:54:00,628 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:54:00,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:54:00,653 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 09:54:00,829 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,SelfDestructingSolverStorable2 [2022-01-10 09:54:00,829 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:54:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:54:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -953919346, now seen corresponding path program 1 times [2022-01-10 09:54:00,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:54:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351516790] [2022-01-10 09:54:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:00,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:54:00,882 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:54:00,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626437499] [2022-01-10 09:54:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:00,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:54:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:54:00,888 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 09:54:00,889 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 09:54:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:54:00,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 09:54:00,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:54:01,055 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 09:54:01,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:54:09,250 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 09:54:09,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:54:09,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351516790] [2022-01-10 09:54:09,251 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:54:09,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626437499] [2022-01-10 09:54:09,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626437499] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:54:09,251 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:54:09,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-01-10 09:54:09,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565896008] [2022-01-10 09:54:09,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:54:09,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 09:54:09,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:54:09,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 09:54:09,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 09:54:09,253 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 09:54:11,279 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 09:54:13,697 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 09:54:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:54:13,783 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-01-10 09:54:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 09:54:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-10 09:54:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:54:13,784 INFO L225 Difference]: With dead ends: 32 [2022-01-10 09:54:13,784 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 09:54:13,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-10 09:54:13,785 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-01-10 09:54:13,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 38 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 2 Unknown, 10 Unchecked, 4.4s Time] [2022-01-10 09:54:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 09:54:13,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-10 09:54:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 09:54:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-01-10 09:54:13,788 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-01-10 09:54:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:54:13,789 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-01-10 09:54:13,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 09:54:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-01-10 09:54:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 09:54:13,789 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:54:13,789 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:54:13,810 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 09:54:13,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:54:14,000 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:54:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:54:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1017934828, now seen corresponding path program 1 times [2022-01-10 09:54:14,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:54:14,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556989975] [2022-01-10 09:54:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:14,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:54:14,032 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:54:14,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671332487] [2022-01-10 09:54:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:14,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:54:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:54:14,039 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 09:54:14,041 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 09:54:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:54:14,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 09:54:14,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:54:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:54:14,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:54:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:54:16,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:54:16,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556989975] [2022-01-10 09:54:16,395 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:54:16,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671332487] [2022-01-10 09:54:16,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671332487] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:54:16,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:54:16,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-01-10 09:54:16,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660581452] [2022-01-10 09:54:16,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:54:16,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 09:54:16,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:54:16,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 09:54:16,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 09:54:16,397 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 09:54:18,539 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 09:54:21,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 09:54:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 09:54:22,325 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-01-10 09:54:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 09:54:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 16 [2022-01-10 09:54:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 09:54:22,327 INFO L225 Difference]: With dead ends: 35 [2022-01-10 09:54:22,327 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 09:54:22,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 09:54:22,329 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-01-10 09:54:22,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 43 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 2 Unknown, 10 Unchecked, 5.9s Time] [2022-01-10 09:54:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 09:54:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-01-10 09:54:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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 09:54:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-01-10 09:54:22,332 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-01-10 09:54:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 09:54:22,332 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-01-10 09:54:22,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 09:54:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-01-10 09:54:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 09:54:22,333 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 09:54:22,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 09:54:22,353 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 09:54:22,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:54:22,543 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 09:54:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 09:54:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash -978045364, now seen corresponding path program 1 times [2022-01-10 09:54:22,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 09:54:22,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995880420] [2022-01-10 09:54:22,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:22,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 09:54:22,597 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-10 09:54:22,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052144242] [2022-01-10 09:54:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 09:54:22,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 09:54:22,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 09:54:22,611 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 09:54:22,612 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 09:54:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 09:54:22,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 09:54:22,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 09:54:23,042 INFO L353 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2022-01-10 09:54:23,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 81 [2022-01-10 09:54:23,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 09:54:23,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 09:54:23,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,145 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 34 treesize of output 28 [2022-01-10 09:54:23,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 15 [2022-01-10 09:54:23,193 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 09:54:23,194 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 17 treesize of output 17 [2022-01-10 09:54:23,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-01-10 09:54:23,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2022-01-10 09:54:23,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 09:54:23,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:54:23,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:54:23,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 83 [2022-01-10 09:54:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 09:54:23,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 09:54:33,250 WARN L228 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 27 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-10 09:54:43,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| Int) (v_ArrVal_194 Int) (v_ArrVal_193 Int)) (let ((.cse3 (let ((.cse5 (mod (* |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 8) 18446744073709551616))) (store (store (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) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5 4) 18446744073709551616) v_ArrVal_193))) (.cse4 (mod (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616))) (let ((.cse2 (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))) (let ((.cse1 (+ (* (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4 .cse4) 18446744073709551616)) 4294967296) .cse2))) (or (= (mod (let ((.cse0 (mod (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 4) 18446744073709551616))) (+ (mod (* .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616) .cse0 1)) 18446744073709551616) .cse1) (< .cse1 0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 0)) (< .cse2 0)))))) is different from false [2022-01-10 09:54:46,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| Int) (v_ArrVal_194 Int) (v_ArrVal_193 Int)) (let ((.cse3 (store (store (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| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse4 (mod (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616))) (let ((.cse2 (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))) (let ((.cse0 (+ (* (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4 .cse4) 18446744073709551616)) 4294967296) .cse2))) (or (= .cse0 (mod (let ((.cse1 (mod (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 4) 18446744073709551616))) (+ (mod (* .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616) .cse1 1)) 18446744073709551616)) (< .cse0 0) (< .cse2 0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 0))))))) is different from false [2022-01-10 09:54:48,682 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| Int) (v_ArrVal_191 (Array Int Int)) (v_ArrVal_194 Int) (v_ArrVal_193 Int)) (let ((.cse3 (store (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| v_ArrVal_191) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse4 (mod (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616))) (let ((.cse2 (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse4) 18446744073709551616)))) (let ((.cse1 (+ .cse2 (* (select .cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4 .cse4) 18446744073709551616)) 4294967296)))) (or (= (mod (let ((.cse0 (mod (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 4) 18446744073709551616))) (+ (mod (* .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616) .cse0 1)) 18446744073709551616) .cse1) (< .cse1 0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 0)) (< .cse2 0)))))) is different from false [2022-01-10 09:54:48,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 09:54:48,729 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 183 treesize of output 173 [2022-01-10 09:54:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 09:54:48,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 09:54:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995880420] [2022-01-10 09:54:48,744 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-10 09:54:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052144242] [2022-01-10 09:54:48,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052144242] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 09:54:48,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 09:54:48,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2022-01-10 09:54:48,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146793151] [2022-01-10 09:54:48,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 09:54:48,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 09:54:48,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 09:54:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 09:54:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=68, Unknown=3, NotChecked=54, Total=156 [2022-01-10 09:54:48,747 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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 09:54:51,062 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| 1)) (= (select .cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4) 18446744073709551616)) (mod (div 1 4294967296) 4294967296)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| Int) (v_ArrVal_191 (Array Int Int)) (v_ArrVal_194 Int) (v_ArrVal_193 Int)) (let ((.cse4 (store (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| v_ArrVal_191) |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse5 (mod (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616))) (let ((.cse3 (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616)))) (let ((.cse2 (+ .cse3 (* (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4 .cse5) 18446744073709551616)) 4294967296)))) (or (= (mod (let ((.cse1 (mod (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 4) 18446744073709551616))) (+ (mod (* .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616) .cse1 1)) 18446744073709551616) .cse2) (< .cse2 0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 0)) (< .cse3 0)))))) (= (mod (div 1 1) 4294967296) (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt|)) (= (select |c_#validInt| 1) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 0))) is different from false [2022-01-10 09:54:53,076 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.baseInt| 1)) (= (select .cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4) 18446744073709551616)) (mod (div 1 4294967296) 4294967296)) (= (mod (div 1 1) 4294967296) (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt|)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| Int) (v_ArrVal_194 Int) (v_ArrVal_193 Int)) (let ((.cse4 (store (store (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| 8) 18446744073709551616) v_ArrVal_194) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_193)) (.cse5 (mod (* 8 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616))) (let ((.cse3 (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| .cse5) 18446744073709551616)))) (let ((.cse1 (+ (* (select .cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 4 .cse5) 18446744073709551616)) 4294967296) .cse3))) (or (= .cse1 (mod (let ((.cse2 (mod (* |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 4) 18446744073709551616))) (+ (mod (* .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|) 18446744073709551616) .cse2 1)) 18446744073709551616)) (< .cse1 0) (< .cse3 0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int_9| 0))))))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~b~0#1.offsetInt| 0))) is different from false