/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:46:27,765 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:46:27,767 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:46:27,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:46:27,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:46:27,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:46:27,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:46:27,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:46:27,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:46:27,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:46:27,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:46:27,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:46:27,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:46:27,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:46:27,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:46:27,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:46:27,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:46:27,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:46:27,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:46:27,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:46:27,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:46:27,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:46:27,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:46:27,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:46:27,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:46:27,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:46:27,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:46:27,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:46:27,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:46:27,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:46:27,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:46:27,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:46:27,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:46:27,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:46:27,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:46:27,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:46:27,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:46:27,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:46:27,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:46:27,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:46:27,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:46:27,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:46:27,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:46:27,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:46:27,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:46:27,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:46:27,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:46:27,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:46:27,900 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:46:27,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:46:27,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:46:27,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:46:27,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:46:27,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:46:27,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:46:27,901 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:46:27,902 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:46:27,902 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:46:27,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:46:27,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:46:27,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:46:27,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:46:27,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:46:27,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:46:27,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:46:27,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:46:27,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:46:27,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:46:27,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:46:27,903 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:46:27,903 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:46:27,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:46:27,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:46:27,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:46:27,904 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:46:27,905 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:46:28,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:46:28,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:46:28,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:46:28,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:46:28,109 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:46:28,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2022-01-10 17:46:28,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0679d45ab/e08a05665a2248b9ab64a93da36183c2/FLAGde2ab7cb8 [2022-01-10 17:46:28,524 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:46:28,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2022-01-10 17:46:28,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0679d45ab/e08a05665a2248b9ab64a93da36183c2/FLAGde2ab7cb8 [2022-01-10 17:46:28,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0679d45ab/e08a05665a2248b9ab64a93da36183c2 [2022-01-10 17:46:28,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:46:28,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:46:28,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:46:28,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:46:28,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:46:28,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:46:28" (1/1) ... [2022-01-10 17:46:28,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ff130a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:28, skipping insertion in model container [2022-01-10 17:46:28,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:46:28" (1/1) ... [2022-01-10 17:46:28,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:46:28,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:46:29,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2022-01-10 17:46:29,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:46:29,266 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:46:29,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i[24291,24304] [2022-01-10 17:46:29,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:46:29,351 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:46:29,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29 WrapperNode [2022-01-10 17:46:29,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:46:29,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:46:29,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:46:29,353 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:46:29,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,422 INFO L137 Inliner]: procedures = 125, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2022-01-10 17:46:29,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:46:29,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:46:29,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:46:29,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:46:29,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:46:29,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:46:29,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:46:29,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:46:29,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (1/1) ... [2022-01-10 17:46:29,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:46:29,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:46:29,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:46:29,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:46:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:46:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:46:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:46:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:46:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:46:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:46:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:46:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:46:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:46:29,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:46:29,652 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:46:29,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:46:30,015 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:46:30,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:46:30,021 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 17:46:30,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:46:30 BoogieIcfgContainer [2022-01-10 17:46:30,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:46:30,024 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:46:30,024 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:46:30,024 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:46:30,026 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:46:30" (1/1) ... [2022-01-10 17:46:30,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:46:30 BasicIcfg [2022-01-10 17:46:30,110 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:46:30,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:46:30,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:46:30,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:46:30,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:46:28" (1/4) ... [2022-01-10 17:46:30,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79983a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:46:30, skipping insertion in model container [2022-01-10 17:46:30,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:46:29" (2/4) ... [2022-01-10 17:46:30,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79983a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:46:30, skipping insertion in model container [2022-01-10 17:46:30,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:46:30" (3/4) ... [2022-01-10 17:46:30,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79983a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:46:30, skipping insertion in model container [2022-01-10 17:46:30,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:46:30" (4/4) ... [2022-01-10 17:46:30,117 INFO L111 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.iTransformedIcfg [2022-01-10 17:46:30,121 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:46:30,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:46:30,158 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:46:30,167 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:46:30,167 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:46:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 17:46:30,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:30,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:30,182 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1999168892, now seen corresponding path program 1 times [2022-01-10 17:46:30,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:30,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356691850] [2022-01-10 17:46:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:30,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:46:30,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:30,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356691850] [2022-01-10 17:46:30,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356691850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:46:30,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:46:30,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:46:30,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681691309] [2022-01-10 17:46:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:46:30,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:46:30,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:46:30,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:46:30,409 INFO L87 Difference]: Start difference. First operand has 45 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:30,424 INFO L93 Difference]: Finished difference Result 88 states and 142 transitions. [2022-01-10 17:46:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:46:30,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 17:46:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:30,433 INFO L225 Difference]: With dead ends: 88 [2022-01-10 17:46:30,433 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 17:46:30,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:46:30,438 INFO L933 BasicCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:30,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:46:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 17:46:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-10 17:46:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 37 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2022-01-10 17:46:30,467 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 16 [2022-01-10 17:46:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:30,467 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2022-01-10 17:46:30,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-01-10 17:46:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:46:30,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:30,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:30,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:46:30,472 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash 865918013, now seen corresponding path program 1 times [2022-01-10 17:46:30,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:30,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977732458] [2022-01-10 17:46:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:30,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:46:30,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:30,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977732458] [2022-01-10 17:46:30,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977732458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:46:30,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:46:30,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:46:30,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773370819] [2022-01-10 17:46:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:46:30,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:46:30,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:30,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:46:30,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:46:30,563 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 17:46:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:30,582 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2022-01-10 17:46:30,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:46:30,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 18 [2022-01-10 17:46:30,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:30,585 INFO L225 Difference]: With dead ends: 64 [2022-01-10 17:46:30,586 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 17:46:30,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:46:30,587 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:30,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 85 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:46:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 17:46:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-01-10 17:46:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2022-01-10 17:46:30,594 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 18 [2022-01-10 17:46:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:30,594 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2022-01-10 17:46:30,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 17:46:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-01-10 17:46:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:46:30,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:30,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:30,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:46:30,596 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1233113289, now seen corresponding path program 1 times [2022-01-10 17:46:30,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:30,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61022108] [2022-01-10 17:46:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:30,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:30,650 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 17:46:30,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:30,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61022108] [2022-01-10 17:46:30,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61022108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:46:30,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:46:30,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:46:30,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966048446] [2022-01-10 17:46:30,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:46:30,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:46:30,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:30,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:46:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:46:30,653 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:30,679 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2022-01-10 17:46:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:46:30,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 24 [2022-01-10 17:46:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:30,683 INFO L225 Difference]: With dead ends: 82 [2022-01-10 17:46:30,683 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 17:46:30,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:46:30,684 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:30,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:46:30,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 17:46:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-10 17:46:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2022-01-10 17:46:30,690 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 24 [2022-01-10 17:46:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:30,690 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2022-01-10 17:46:30,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-01-10 17:46:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:46:30,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:30,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:30,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:46:30,693 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2064781654, now seen corresponding path program 1 times [2022-01-10 17:46:30,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:30,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056102791] [2022-01-10 17:46:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:30,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:30,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:30,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056102791] [2022-01-10 17:46:30,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056102791] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:46:30,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:46:30,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:46:30,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341106457] [2022-01-10 17:46:30,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:46:30,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:46:30,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:30,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:46:30,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:46:30,916 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:31,069 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-01-10 17:46:31,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:46:31,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 17:46:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:31,073 INFO L225 Difference]: With dead ends: 71 [2022-01-10 17:46:31,073 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 17:46:31,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 17:46:31,082 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:31,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:46:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 17:46:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-01-10 17:46:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2022-01-10 17:46:31,089 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 24 [2022-01-10 17:46:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:31,089 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2022-01-10 17:46:31,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2022-01-10 17:46:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:46:31,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:31,090 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:31,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:46:31,090 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 6081297, now seen corresponding path program 1 times [2022-01-10 17:46:31,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:31,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656268216] [2022-01-10 17:46:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:31,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:31,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:31,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656268216] [2022-01-10 17:46:31,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656268216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:46:31,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:46:31,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:46:31,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046566879] [2022-01-10 17:46:31,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:46:31,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:46:31,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:31,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:46:31,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:46:31,268 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 17:46:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:31,392 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-01-10 17:46:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:46:31,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 26 [2022-01-10 17:46:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:31,394 INFO L225 Difference]: With dead ends: 73 [2022-01-10 17:46:31,394 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 17:46:31,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:46:31,397 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:31,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 156 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:46:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 17:46:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-01-10 17:46:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:31,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2022-01-10 17:46:31,403 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 26 [2022-01-10 17:46:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:31,403 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2022-01-10 17:46:31,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 17:46:31,403 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-01-10 17:46:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:46:31,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:31,404 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:31,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 17:46:31,404 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1915639696, now seen corresponding path program 1 times [2022-01-10 17:46:31,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:31,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712827660] [2022-01-10 17:46:31,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:31,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:31,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:31,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712827660] [2022-01-10 17:46:31,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712827660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:46:31,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:46:31,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:46:31,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728237858] [2022-01-10 17:46:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:46:31,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:46:31,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:31,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:46:31,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:46:31,526 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 17:46:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:31,640 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-01-10 17:46:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:46:31,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 26 [2022-01-10 17:46:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:31,642 INFO L225 Difference]: With dead ends: 73 [2022-01-10 17:46:31,642 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 17:46:31,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:46:31,643 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 34 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:31,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 146 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:46:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 17:46:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-01-10 17:46:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2022-01-10 17:46:31,652 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 26 [2022-01-10 17:46:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:31,652 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2022-01-10 17:46:31,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 17:46:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2022-01-10 17:46:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 17:46:31,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:31,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:31,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 17:46:31,653 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:31,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1948184160, now seen corresponding path program 1 times [2022-01-10 17:46:31,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:31,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327400995] [2022-01-10 17:46:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:31,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:31,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:31,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327400995] [2022-01-10 17:46:31,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327400995] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:46:31,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579115470] [2022-01-10 17:46:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:31,901 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:31,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:46:31,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:46:31,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:46:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:32,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-10 17:46:32,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:46:32,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:46:32,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:46:32,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 17:46:32,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:46:32,366 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 17:46:32,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 17:46:32,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:46:32,680 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:32,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-01-10 17:46:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:32,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:46:33,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-10 17:46:34,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_197)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-10 17:46:34,888 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 543 treesize of output 527 [2022-01-10 17:46:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-10 17:46:35,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579115470] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:46:35,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:46:35,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2022-01-10 17:46:35,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822029039] [2022-01-10 17:46:35,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:46:35,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 17:46:35,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:35,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 17:46:35,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=310, Unknown=2, NotChecked=74, Total=462 [2022-01-10 17:46:35,910 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:37,147 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_197)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:46:39,166 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_197 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_197)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:46:41,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= 2 (select .cse1 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))) is different from false [2022-01-10 17:46:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:41,321 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2022-01-10 17:46:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 17:46:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 17:46:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:41,323 INFO L225 Difference]: With dead ends: 92 [2022-01-10 17:46:41,323 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 17:46:41,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=101, Invalid=420, Unknown=5, NotChecked=230, Total=756 [2022-01-10 17:46:41,324 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:41,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 477 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 170 Invalid, 0 Unknown, 104 Unchecked, 0.2s Time] [2022-01-10 17:46:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 17:46:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2022-01-10 17:46:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2022-01-10 17:46:41,329 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 27 [2022-01-10 17:46:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:41,330 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2022-01-10 17:46:41,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2022-01-10 17:46:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 17:46:41,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:41,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:41,356 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 17:46:41,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:41,544 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2058372434, now seen corresponding path program 1 times [2022-01-10 17:46:41,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:41,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390174485] [2022-01-10 17:46:41,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:41,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:41,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390174485] [2022-01-10 17:46:41,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390174485] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:46:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406907944] [2022-01-10 17:46:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:41,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:41,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:46:41,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:46:41,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:46:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:41,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 17:46:41,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:46:41,952 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 6 treesize of output 5 [2022-01-10 17:46:42,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:46:42,034 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:46:42,034 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 16 treesize of output 14 [2022-01-10 17:46:42,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:46:42,085 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 23 treesize of output 22 [2022-01-10 17:46:42,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:46:42,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:46:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:42,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:46:42,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_280) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 17:46:42,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 Int) (v_ArrVal_280 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_277)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_280) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 17:46:42,268 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 17:46:42,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-01-10 17:46:42,276 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:42,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-01-10 17:46:42,281 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 9 treesize of output 7 [2022-01-10 17:46:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-10 17:46:42,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406907944] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:46:42,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:46:42,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-01-10 17:46:42,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835892403] [2022-01-10 17:46:42,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:46:42,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 17:46:42,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:42,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 17:46:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=278, Unknown=2, NotChecked=70, Total=420 [2022-01-10 17:46:42,408 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:42,786 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2022-01-10 17:46:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 17:46:42,786 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 17:46:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:42,787 INFO L225 Difference]: With dead ends: 101 [2022-01-10 17:46:42,787 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 17:46:42,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=471, Unknown=2, NotChecked=94, Total=702 [2022-01-10 17:46:42,788 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:42,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 393 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 183 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2022-01-10 17:46:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 17:46:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2022-01-10 17:46:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-01-10 17:46:42,811 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 27 [2022-01-10 17:46:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:42,811 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-01-10 17:46:42,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-01-10 17:46:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:46:42,812 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:42,812 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:42,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:46:43,027 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,SelfDestructingSolverStorable7 [2022-01-10 17:46:43,027 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1495155142, now seen corresponding path program 1 times [2022-01-10 17:46:43,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:43,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705497779] [2022-01-10 17:46:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:43,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:43,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:43,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705497779] [2022-01-10 17:46:43,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705497779] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:46:43,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836616332] [2022-01-10 17:46:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:43,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:46:43,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:46:43,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:46:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:43,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 17:46:43,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:46:43,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:46:43,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:46:43,668 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:46:43,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2022-01-10 17:46:43,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-01-10 17:46:43,690 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 17:46:43,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 64 [2022-01-10 17:46:43,704 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 29 treesize of output 17 [2022-01-10 17:46:43,726 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 32 treesize of output 14 [2022-01-10 17:46:43,874 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 73 treesize of output 57 [2022-01-10 17:46:43,879 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 68 treesize of output 36 [2022-01-10 17:46:44,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:46:44,040 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:46:44,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-01-10 17:46:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:44,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:46:44,172 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:44,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 109 [2022-01-10 17:46:44,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:44,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2022-01-10 17:46:44,265 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:44,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-01-10 17:46:44,274 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:44,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 73 [2022-01-10 17:46:44,287 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:44,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 92 [2022-01-10 17:46:44,298 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 45 treesize of output 39 [2022-01-10 17:46:44,305 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 39 treesize of output 33 [2022-01-10 17:46:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:44,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836616332] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:46:44,492 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:46:44,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-01-10 17:46:44,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633896458] [2022-01-10 17:46:44,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:46:44,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 17:46:44,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:44,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 17:46:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-01-10 17:46:44,494 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:45,129 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2022-01-10 17:46:45,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 17:46:45,129 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 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 29 [2022-01-10 17:46:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:45,130 INFO L225 Difference]: With dead ends: 78 [2022-01-10 17:46:45,130 INFO L226 Difference]: Without dead ends: 74 [2022-01-10 17:46:45,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2022-01-10 17:46:45,131 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 28 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:45,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 367 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2022-01-10 17:46:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-01-10 17:46:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2022-01-10 17:46:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-01-10 17:46:45,136 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 29 [2022-01-10 17:46:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:45,137 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-01-10 17:46:45,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-01-10 17:46:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:46:45,138 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:45,138 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:45,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:46:45,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:45,354 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:45,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1858211827, now seen corresponding path program 1 times [2022-01-10 17:46:45,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:45,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629843792] [2022-01-10 17:46:45,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:45,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:45,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:45,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629843792] [2022-01-10 17:46:45,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629843792] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:46:45,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868321703] [2022-01-10 17:46:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:45,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:46:45,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:46:45,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:46:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:45,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-10 17:46:45,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:46:45,959 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 6 treesize of output 5 [2022-01-10 17:46:46,025 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:46:46,026 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 16 treesize of output 14 [2022-01-10 17:46:46,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:46:46,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:46:46,162 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:46:46,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 73 [2022-01-10 17:46:46,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2022-01-10 17:46:46,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-10 17:46:46,240 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 47 treesize of output 23 [2022-01-10 17:46:46,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-10 17:46:46,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:46:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:46:46,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:46:46,332 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 91 treesize of output 65 [2022-01-10 17:46:46,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_434 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_434) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))) (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_435) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|))) is different from false [2022-01-10 17:46:46,367 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:46,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-10 17:46:46,375 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:46,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2022-01-10 17:46:46,379 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 7 [2022-01-10 17:46:46,414 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 17:46:46,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-10 17:46:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-01-10 17:46:46,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868321703] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:46:46,533 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:46:46,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2022-01-10 17:46:46,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414093277] [2022-01-10 17:46:46,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:46:46,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 17:46:46,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:46,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 17:46:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=320, Unknown=1, NotChecked=36, Total=420 [2022-01-10 17:46:46,535 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:47,154 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2022-01-10 17:46:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 17:46:47,155 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 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 29 [2022-01-10 17:46:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:47,155 INFO L225 Difference]: With dead ends: 91 [2022-01-10 17:46:47,156 INFO L226 Difference]: Without dead ends: 87 [2022-01-10 17:46:47,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=647, Unknown=1, NotChecked=54, Total=870 [2022-01-10 17:46:47,157 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 227 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:47,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 296 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 278 Invalid, 0 Unknown, 111 Unchecked, 0.3s Time] [2022-01-10 17:46:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-10 17:46:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2022-01-10 17:46:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2022-01-10 17:46:47,162 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 29 [2022-01-10 17:46:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:47,163 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2022-01-10 17:46:47,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2022-01-10 17:46:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 17:46:47,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:47,164 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:47,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 17:46:47,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:47,387 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1798064874, now seen corresponding path program 2 times [2022-01-10 17:46:47,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:47,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520677117] [2022-01-10 17:46:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:47,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:47,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:47,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520677117] [2022-01-10 17:46:47,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520677117] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:46:47,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151428132] [2022-01-10 17:46:47,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:46:47,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:47,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:46:47,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:46:47,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:46:47,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:46:47,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:46:47,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-10 17:46:47,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:46:47,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:46:47,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:46:47,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 17:46:47,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:46:47,998 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 17:46:47,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 17:46:48,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:46:48,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:46:48,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:46:48,068 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:46:48,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-10 17:46:48,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:46:48,124 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 17:46:48,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 17:46:48,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:46:48,352 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:46:48,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-01-10 17:46:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:46:48,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:46:49,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-10 17:46:50,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_546 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_546)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (= .cse0 2)))) is different from false [2022-01-10 17:46:52,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int) (v_ArrVal_546 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_546)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 0)) (= .cse0 2)))) is different from false [2022-01-10 17:46:54,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_540 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_33| Int) (v_ArrVal_546 Int)) (let ((.cse0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_540)))) (store .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_33| (store (store (select .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_33|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_546))))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_9| 0)) (= 2 .cse0)))) is different from false [2022-01-10 17:46:57,018 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 16343 treesize of output 16215 [2022-01-10 17:46:57,738 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 17:46:57,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:46:57,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-01-10 17:46:57,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429388692] [2022-01-10 17:46:57,738 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 17:46:57,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 17:46:57,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:46:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 17:46:57,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=459, Unknown=4, NotChecked=188, Total=756 [2022-01-10 17:46:57,739 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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 17:46:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:46:57,883 INFO L93 Difference]: Finished difference Result 89 states and 118 transitions. [2022-01-10 17:46:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:46:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) Word has length 30 [2022-01-10 17:46:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:46:57,884 INFO L225 Difference]: With dead ends: 89 [2022-01-10 17:46:57,884 INFO L226 Difference]: Without dead ends: 83 [2022-01-10 17:46:57,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=124, Invalid=538, Unknown=4, NotChecked=204, Total=870 [2022-01-10 17:46:57,885 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:46:57,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 200 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:46:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-10 17:46:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2022-01-10 17:46:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:46:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2022-01-10 17:46:57,890 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 30 [2022-01-10 17:46:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:46:57,890 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2022-01-10 17:46:57,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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 17:46:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2022-01-10 17:46:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 17:46:57,891 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:46:57,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:46:57,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 17:46:58,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 17:46:58,092 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:46:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:46:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 388271140, now seen corresponding path program 1 times [2022-01-10 17:46:58,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:46:58,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444299818] [2022-01-10 17:46:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:58,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:46:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:58,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:46:58,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444299818] [2022-01-10 17:46:58,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444299818] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:46:58,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310659737] [2022-01-10 17:46:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:46:58,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:46:58,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:46:58,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:46:58,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 17:46:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:46:58,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-10 17:46:58,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:46:58,536 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 6 treesize of output 5 [2022-01-10 17:46:58,569 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:46:58,570 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 16 treesize of output 14 [2022-01-10 17:46:58,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:46:58,598 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 19 treesize of output 18 [2022-01-10 17:46:58,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:46:58,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:46:58,687 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 17:46:58,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 17:46:58,790 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 22 treesize of output 10 [2022-01-10 17:46:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:46:58,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:47:00,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) is different from false [2022-01-10 17:47:00,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) is different from false [2022-01-10 17:47:00,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (= .cse0 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) is different from false [2022-01-10 17:47:00,509 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_654)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (and (<= .cse0 3) (< 2 .cse0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) is different from false [2022-01-10 17:47:00,627 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 17:47:00,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 85 [2022-01-10 17:47:00,653 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:00,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 397 [2022-01-10 17:47:00,670 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 393 treesize of output 369 [2022-01-10 17:47:00,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:00,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:00,926 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 14 treesize of output 12 [2022-01-10 17:47:00,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:00,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:01,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:47:01,006 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:47:01,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:01,058 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 96 treesize of output 90 [2022-01-10 17:47:01,260 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 56 treesize of output 52 [2022-01-10 17:47:01,301 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 40 treesize of output 36 [2022-01-10 17:47:01,488 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 40 treesize of output 36 [2022-01-10 17:47:01,561 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 93 treesize of output 87 [2022-01-10 17:47:01,837 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 6 treesize of output 4 [2022-01-10 17:47:02,135 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:02,135 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 38 treesize of output 38 [2022-01-10 17:47:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-01-10 17:47:02,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310659737] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:47:02,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:47:02,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2022-01-10 17:47:02,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926966307] [2022-01-10 17:47:02,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:47:02,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 17:47:02,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:47:02,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 17:47:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=349, Unknown=4, NotChecked=164, Total=600 [2022-01-10 17:47:02,254 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:02,398 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (= .cse0 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:47:02,408 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 3) (< 2 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (= .cse0 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 0))))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:47:02,414 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (forall ((v_ArrVal_658 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_658))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_39|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3)))))) is different from false [2022-01-10 17:47:03,607 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 1) (and (< 2 .cse0) (<= .cse0 3))))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:47:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:47:03,683 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-01-10 17:47:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 17:47:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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 30 [2022-01-10 17:47:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:47:03,684 INFO L225 Difference]: With dead ends: 97 [2022-01-10 17:47:03,684 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 17:47:03,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=121, Invalid=455, Unknown=8, NotChecked=408, Total=992 [2022-01-10 17:47:03,685 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 33 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:47:03,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 466 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 164 Invalid, 0 Unknown, 181 Unchecked, 0.2s Time] [2022-01-10 17:47:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 17:47:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-01-10 17:47:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2022-01-10 17:47:03,690 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 30 [2022-01-10 17:47:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:47:03,691 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2022-01-10 17:47:03,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2022-01-10 17:47:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 17:47:03,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:47:03,692 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:47:03,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 17:47:03,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:47:03,907 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:47:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:47:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash 99860438, now seen corresponding path program 2 times [2022-01-10 17:47:03,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:47:03,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751421974] [2022-01-10 17:47:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:03,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:47:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:47:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:47:04,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:47:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751421974] [2022-01-10 17:47:04,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751421974] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:47:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461577898] [2022-01-10 17:47:04,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:47:04,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:47:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:47:04,166 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:47:04,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 17:47:04,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:47:04,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:47:04,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-10 17:47:04,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:47:04,330 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 6 treesize of output 5 [2022-01-10 17:47:04,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:47:04,394 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:47:04,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 17:47:04,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:04,448 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 23 treesize of output 22 [2022-01-10 17:47:04,492 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 17:47:04,492 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2022-01-10 17:47:04,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:47:04,545 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:47:04,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:47:04,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:47:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:04,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:47:04,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_771 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_771) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 17:47:04,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_771) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 17:47:04,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (let ((.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_771) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)))) is different from false [2022-01-10 17:47:04,777 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 17:47:04,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-01-10 17:47:04,785 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:04,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2022-01-10 17:47:04,790 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 106 treesize of output 98 [2022-01-10 17:47:04,795 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 98 treesize of output 94 [2022-01-10 17:47:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-01-10 17:47:05,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461577898] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:47:05,152 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:47:05,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-01-10 17:47:05,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74626641] [2022-01-10 17:47:05,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:47:05,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 17:47:05,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:47:05,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 17:47:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=416, Unknown=6, NotChecked=132, Total=650 [2022-01-10 17:47:05,154 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:05,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (let ((.cse1 (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1)) (.cse0 (not .cse3)) (.cse5 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and .cse0 (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_771) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) .cse1 (let ((.cse2 (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) (.cse4 (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0))) (or (and .cse2 .cse3 .cse1 .cse4 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0)) (and .cse0 .cse2 .cse4 (= (select .cse5 0) 1)))) (= (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)))) is different from false [2022-01-10 17:47:05,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_769 (Array Int Int)) (v_ArrVal_771 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_769) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_771) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (let ((.cse1 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse0 (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) (.cse2 (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0))) (or (and .cse0 .cse1 (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) .cse2 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0)) (and (not .cse1) .cse0 .cse2 (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:47:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:47:06,198 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-01-10 17:47:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 17:47:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 17:47:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:47:06,199 INFO L225 Difference]: With dead ends: 169 [2022-01-10 17:47:06,199 INFO L226 Difference]: Without dead ends: 161 [2022-01-10 17:47:06,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=368, Invalid=1447, Unknown=11, NotChecked=430, Total=2256 [2022-01-10 17:47:06,201 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 135 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 17:47:06,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 648 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 288 Invalid, 0 Unknown, 359 Unchecked, 0.3s Time] [2022-01-10 17:47:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-01-10 17:47:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 87. [2022-01-10 17:47:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2022-01-10 17:47:06,207 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 30 [2022-01-10 17:47:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:47:06,207 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2022-01-10 17:47:06,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2022-01-10 17:47:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 17:47:06,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:47:06,208 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:47:06,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 17:47:06,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:47:06,415 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:47:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:47:06,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1995755253, now seen corresponding path program 1 times [2022-01-10 17:47:06,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:47:06,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392357355] [2022-01-10 17:47:06,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:06,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:47:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:47:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:06,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:47:06,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392357355] [2022-01-10 17:47:06,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392357355] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:47:06,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550179597] [2022-01-10 17:47:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:06,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:47:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:47:06,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:47:06,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 17:47:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:47:06,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-10 17:47:06,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:47:06,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:47:06,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:47:06,963 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:47:06,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2022-01-10 17:47:06,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-01-10 17:47:06,978 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 17:47:06,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 64 [2022-01-10 17:47:06,986 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 29 treesize of output 17 [2022-01-10 17:47:06,996 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 29 treesize of output 17 [2022-01-10 17:47:07,009 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 32 treesize of output 14 [2022-01-10 17:47:07,130 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 73 treesize of output 57 [2022-01-10 17:47:07,135 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 68 treesize of output 36 [2022-01-10 17:47:07,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:47:07,252 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:47:07,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-01-10 17:47:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:07,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:47:07,373 INFO L353 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2022-01-10 17:47:07,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 74 [2022-01-10 17:47:07,509 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:07,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 95 [2022-01-10 17:47:07,516 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:07,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 71 [2022-01-10 17:47:07,523 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:07,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 101 [2022-01-10 17:47:07,541 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:07,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 114 [2022-01-10 17:47:07,546 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 91 treesize of output 79 [2022-01-10 17:47:07,549 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 79 treesize of output 67 [2022-01-10 17:47:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:07,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550179597] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:47:07,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:47:07,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2022-01-10 17:47:07,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300068860] [2022-01-10 17:47:07,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:47:07,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 17:47:07,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:47:07,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 17:47:07,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2022-01-10 17:47:07,777 INFO L87 Difference]: Start difference. First operand 87 states and 118 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:47:08,204 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2022-01-10 17:47:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 17:47:08,206 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 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 31 [2022-01-10 17:47:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:47:08,207 INFO L225 Difference]: With dead ends: 98 [2022-01-10 17:47:08,207 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 17:47:08,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2022-01-10 17:47:08,207 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:47:08,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 422 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 174 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2022-01-10 17:47:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 17:47:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-01-10 17:47:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 114 transitions. [2022-01-10 17:47:08,213 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 114 transitions. Word has length 31 [2022-01-10 17:47:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:47:08,213 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 114 transitions. [2022-01-10 17:47:08,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 114 transitions. [2022-01-10 17:47:08,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 17:47:08,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:47:08,214 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:47:08,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-10 17:47:08,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-10 17:47:08,432 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:47:08,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:47:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 990631944, now seen corresponding path program 2 times [2022-01-10 17:47:08,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:47:08,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644840473] [2022-01-10 17:47:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:08,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:47:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:47:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:08,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:47:08,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644840473] [2022-01-10 17:47:08,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644840473] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:47:08,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6120905] [2022-01-10 17:47:08,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:47:08,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:47:08,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:47:08,681 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:47:08,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 17:47:08,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:47:08,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:47:08,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-10 17:47:08,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:47:08,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:47:08,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:47:09,020 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:47:09,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 47 [2022-01-10 17:47:09,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-10 17:47:09,034 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 17:47:09,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2022-01-10 17:47:09,043 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 17 treesize of output 13 [2022-01-10 17:47:09,055 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 19 treesize of output 15 [2022-01-10 17:47:09,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:47:09,152 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 23 treesize of output 15 [2022-01-10 17:47:09,154 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 26 treesize of output 14 [2022-01-10 17:47:09,179 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:47:09,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-01-10 17:47:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:09,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:47:09,279 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-01-10 17:47:09,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 45 [2022-01-10 17:47:09,343 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:09,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2022-01-10 17:47:09,347 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:09,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-01-10 17:47:09,355 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:09,355 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 73 [2022-01-10 17:47:09,362 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:09,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 92 [2022-01-10 17:47:09,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 45 treesize of output 39 [2022-01-10 17:47:09,375 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 39 treesize of output 33 [2022-01-10 17:47:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:09,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6120905] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:47:09,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:47:09,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-01-10 17:47:09,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983303709] [2022-01-10 17:47:09,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:47:09,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 17:47:09,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:47:09,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 17:47:09,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-01-10 17:47:09,522 INFO L87 Difference]: Start difference. First operand 84 states and 114 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:47:10,117 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2022-01-10 17:47:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 17:47:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 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 31 [2022-01-10 17:47:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:47:10,118 INFO L225 Difference]: With dead ends: 105 [2022-01-10 17:47:10,118 INFO L226 Difference]: Without dead ends: 95 [2022-01-10 17:47:10,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2022-01-10 17:47:10,119 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 17:47:10,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 497 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 380 Invalid, 0 Unknown, 39 Unchecked, 0.4s Time] [2022-01-10 17:47:10,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-10 17:47:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2022-01-10 17:47:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2022-01-10 17:47:10,124 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 31 [2022-01-10 17:47:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:47:10,125 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2022-01-10 17:47:10,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2022-01-10 17:47:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 17:47:10,125 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:47:10,125 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:47:10,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 17:47:10,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 17:47:10,343 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:47:10,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:47:10,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1052694951, now seen corresponding path program 1 times [2022-01-10 17:47:10,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:47:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909097154] [2022-01-10 17:47:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:10,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:47:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:47:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 17:47:10,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:47:10,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909097154] [2022-01-10 17:47:10,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909097154] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:47:10,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459538768] [2022-01-10 17:47:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:10,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:47:10,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:47:10,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:47:10,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 17:47:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:47:10,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-10 17:47:10,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:47:10,677 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 6 treesize of output 5 [2022-01-10 17:47:10,727 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:47:10,727 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 16 treesize of output 14 [2022-01-10 17:47:10,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:47:10,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:10,772 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 23 treesize of output 22 [2022-01-10 17:47:10,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:47:10,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:47:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 17:47:10,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:47:10,933 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 17:47:10,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-01-10 17:47:10,940 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:10,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-01-10 17:47:10,943 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 20 treesize of output 18 [2022-01-10 17:47:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 17:47:11,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459538768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:47:11,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:47:11,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-01-10 17:47:11,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110624334] [2022-01-10 17:47:11,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:47:11,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 17:47:11,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:47:11,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 17:47:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=307, Unknown=1, NotChecked=0, Total=380 [2022-01-10 17:47:11,025 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:47:11,304 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-01-10 17:47:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:47:11,305 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 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 31 [2022-01-10 17:47:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:47:11,305 INFO L225 Difference]: With dead ends: 98 [2022-01-10 17:47:11,305 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 17:47:11,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=505, Unknown=1, NotChecked=0, Total=650 [2022-01-10 17:47:11,306 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 84 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:47:11,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 426 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 159 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2022-01-10 17:47:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 17:47:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2022-01-10 17:47:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2022-01-10 17:47:11,310 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 31 [2022-01-10 17:47:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:47:11,310 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2022-01-10 17:47:11,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2022-01-10 17:47:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 17:47:11,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:47:11,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:47:11,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-01-10 17:47:11,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-10 17:47:11,519 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:47:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:47:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1035557936, now seen corresponding path program 2 times [2022-01-10 17:47:11,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:47:11,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685906523] [2022-01-10 17:47:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:11,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:47:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:47:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:11,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:47:11,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685906523] [2022-01-10 17:47:11,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685906523] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:47:11,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519726912] [2022-01-10 17:47:11,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:47:11,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:47:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:47:11,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:47:11,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 17:47:12,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:47:12,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:47:12,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-10 17:47:12,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:47:12,091 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 6 treesize of output 5 [2022-01-10 17:47:12,141 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:47:12,141 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 13 treesize of output 13 [2022-01-10 17:47:12,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:47:12,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:47:12,247 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:47:12,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-01-10 17:47:12,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:12,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2022-01-10 17:47:12,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:47:12,343 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:47:12,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 98 [2022-01-10 17:47:12,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:47:12,351 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 43 treesize of output 38 [2022-01-10 17:47:12,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2022-01-10 17:47:12,453 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:47:12,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 93 [2022-01-10 17:47:12,481 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-01-10 17:47:12,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 90 [2022-01-10 17:47:12,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:47:12,498 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-10 17:47:12,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-01-10 17:47:12,602 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 38 treesize of output 14 [2022-01-10 17:47:12,636 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 98 treesize of output 86 [2022-01-10 17:47:12,966 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 177 treesize of output 155 [2022-01-10 17:47:13,535 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 271 treesize of output 239 [2022-01-10 17:47:13,581 INFO L353 Elim1Store]: treesize reduction 48, result has 37.7 percent of original size [2022-01-10 17:47:13,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 246 treesize of output 157 [2022-01-10 17:47:14,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:47:14,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:47:14,094 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 17:47:14,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 17 [2022-01-10 17:47:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:47:14,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:47:16,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse0 (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1)) (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1))))) (or (= 3 .cse0) (= 2 .cse0)))) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2)))) is different from false [2022-01-10 17:47:16,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1114 Int) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (let ((.cse4 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse3 v_ArrVal_1114)))) (store .cse4 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| (store (select .cse4 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse1 (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2))))) (or (not (= 2 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= .cse1 2) (= .cse1 3)))))) is different from false [2022-01-10 17:47:16,416 INFO L353 Elim1Store]: treesize reduction 4, result has 91.3 percent of original size [2022-01-10 17:47:16,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2295 treesize of output 2177 [2022-01-10 17:47:16,434 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:16,434 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1515 treesize of output 1294 [2022-01-10 17:47:20,535 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 30 treesize of output 12 [2022-01-10 17:47:20,597 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 21 treesize of output 9 [2022-01-10 17:47:21,393 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 30 treesize of output 12 [2022-01-10 17:47:21,421 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 21 treesize of output 9 [2022-01-10 17:47:21,625 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 30 treesize of output 12 [2022-01-10 17:47:21,671 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 21 treesize of output 9 [2022-01-10 17:47:21,896 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 21 treesize of output 9 [2022-01-10 17:47:22,088 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 21 treesize of output 9 [2022-01-10 17:47:22,145 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 30 treesize of output 12 [2022-01-10 17:47:22,219 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 30 treesize of output 12 [2022-01-10 17:47:24,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select v_arrayElimArr_13 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_arrayElimArr_13) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))) (or (not (<= .cse0 0)) (and (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 .cse0)) (let ((.cse3 (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) (and (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1) .cse3) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| .cse2) .cse3))) (and (= .cse0 .cse2) (= .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|)))))) is different from false [2022-01-10 17:47:24,233 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:24,233 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 188 [2022-01-10 17:47:24,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:24,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 152 [2022-01-10 17:47:24,249 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:24,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 580 treesize of output 543 [2022-01-10 17:47:24,268 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:24,268 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 540 treesize of output 448 [2022-01-10 17:47:24,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 424 treesize of output 352 [2022-01-10 17:47:24,290 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:47:24,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 516 treesize of output 503 [2022-01-10 17:47:24,300 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 480 treesize of output 444 [2022-01-10 17:47:24,307 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 444 treesize of output 426 [2022-01-10 17:47:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-01-10 17:47:25,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519726912] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:47:25,642 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:47:25,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2022-01-10 17:47:25,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311529493] [2022-01-10 17:47:25,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:47:25,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-10 17:47:25,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:47:25,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-10 17:47:25,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=720, Unknown=3, NotChecked=168, Total=992 [2022-01-10 17:47:25,643 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:26,046 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4))) (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (<= 0 .cse0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1114 Int) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse6 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse5 v_ArrVal_1114)))) (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| (store (select .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse3 (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))))) (or (not (= 2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= .cse3 2) (= .cse3 3)))))) (<= .cse0 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse1)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))) is different from false [2022-01-10 17:47:26,082 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4))) (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (<= 0 .cse0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1114 Int) (v_ArrVal_1121 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| Int)) (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse6 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse5 v_ArrVal_1114)))) (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| (store (select .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse3 (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1116) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_79| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))))) (or (not (= 2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= .cse3 2) (= .cse3 3)))))) (<= .cse0 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse1)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))) is different from false [2022-01-10 17:47:28,103 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offsetInt| .cse1) (mod (+ .cse0 4) 18446744073709551616)))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= 0 .cse0) (= (select (select |c_#memory_intInt| .cse1) .cse0) 2) (<= 0 .cse2) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse3 (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1121) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4)) (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_1119) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))))) (or (= 3 .cse3) (= 2 .cse3)))) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2)))) (<= .cse0 0) (<= .cse2 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse1)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1)) (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)))) is different from false [2022-01-10 17:47:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:47:28,567 INFO L93 Difference]: Finished difference Result 110 states and 144 transitions. [2022-01-10 17:47:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-10 17:47:28,568 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 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 32 [2022-01-10 17:47:28,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:47:28,568 INFO L225 Difference]: With dead ends: 110 [2022-01-10 17:47:28,568 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 17:47:28,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=216, Invalid=1694, Unknown=6, NotChecked=534, Total=2450 [2022-01-10 17:47:28,569 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 32 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 17:47:28,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 592 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 390 Invalid, 0 Unknown, 248 Unchecked, 0.4s Time] [2022-01-10 17:47:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 17:47:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2022-01-10 17:47:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2022-01-10 17:47:28,575 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 32 [2022-01-10 17:47:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:47:28,575 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-01-10 17:47:28,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:47:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-01-10 17:47:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 17:47:28,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:47:28,576 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:47:28,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-10 17:47:28,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-10 17:47:28,787 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:47:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:47:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash -507786657, now seen corresponding path program 1 times [2022-01-10 17:47:28,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:47:28,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157055435] [2022-01-10 17:47:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:47:28,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:47:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 17:47:28,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 17:47:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 17:47:28,917 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 17:47:28,917 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 17:47:28,918 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 17:47:28,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 17:47:28,924 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:47:28,926 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 17:47:29,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:47:29 BasicIcfg [2022-01-10 17:47:29,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 17:47:29,006 INFO L158 Benchmark]: Toolchain (without parser) took 60116.84ms. Allocated memory was 186.6MB in the beginning and 329.3MB in the end (delta: 142.6MB). Free memory was 128.7MB in the beginning and 193.8MB in the end (delta: -65.0MB). Peak memory consumption was 79.1MB. Max. memory is 8.0GB. [2022-01-10 17:47:29,006 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 17:47:29,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.36ms. Allocated memory was 186.6MB in the beginning and 273.7MB in the end (delta: 87.0MB). Free memory was 128.5MB in the beginning and 237.3MB in the end (delta: -108.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 17:47:29,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.16ms. Allocated memory is still 273.7MB. Free memory was 237.3MB in the beginning and 234.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 17:47:29,007 INFO L158 Benchmark]: Boogie Preprocessor took 41.25ms. Allocated memory is still 273.7MB. Free memory was 234.7MB in the beginning and 232.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 17:47:29,007 INFO L158 Benchmark]: RCFGBuilder took 557.83ms. Allocated memory is still 273.7MB. Free memory was 232.6MB in the beginning and 211.1MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-01-10 17:47:29,007 INFO L158 Benchmark]: IcfgTransformer took 86.84ms. Allocated memory is still 273.7MB. Free memory was 211.1MB in the beginning and 203.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-01-10 17:47:29,007 INFO L158 Benchmark]: TraceAbstraction took 58893.72ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 203.2MB in the beginning and 193.8MB in the end (delta: 9.4MB). Peak memory consumption was 66.6MB. Max. memory is 8.0GB. [2022-01-10 17:47:29,008 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.36ms. Allocated memory was 186.6MB in the beginning and 273.7MB in the end (delta: 87.0MB). Free memory was 128.5MB in the beginning and 237.3MB in the end (delta: -108.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.16ms. Allocated memory is still 273.7MB. Free memory was 237.3MB in the beginning and 234.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.25ms. Allocated memory is still 273.7MB. Free memory was 234.7MB in the beginning and 232.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 557.83ms. Allocated memory is still 273.7MB. Free memory was 232.6MB in the beginning and 211.1MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * IcfgTransformer took 86.84ms. Allocated memory is still 273.7MB. Free memory was 211.1MB in the beginning and 203.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * TraceAbstraction took 58893.72ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 203.2MB in the beginning and 193.8MB in the end (delta: 9.4MB). Peak memory consumption was 66.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 620]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L552] struct TreeNode* root = malloc(sizeof(*root)), *n; [L553] root->left = ((void *)0) [L554] root->right = ((void *)0) VAL [root={-11:0}] [L555] COND FALSE !(__VERIFIER_nondet_int()) [L574] n = ((void *)0) [L575] struct TreeNode* pred; VAL [n={0:0}, root={-11:0}] [L576] COND TRUE \read(*root) [L577] pred = ((void *)0) [L578] n = root VAL [n={-11:0}, pred={0:0}, root={-11:0}] [L579] EXPR n->left [L579] n->left || n->right [L579] EXPR n->right [L579] n->left || n->right VAL [n={-11:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-11:0}] [L579] COND FALSE !(n->left || n->right) [L586] COND FALSE !(\read(*pred)) [L592] root = ((void *)0) VAL [n={-11:0}, pred={0:0}, root={0:0}] [L576] COND FALSE !(\read(*root)) VAL [n={-11:0}, pred={0:0}, root={0:0}] [L595] List a = (List) malloc(sizeof(struct node)); [L596] COND FALSE !(a == 0) VAL [a={-2:0}, n={-11:0}, pred={0:0}, root={0:0}] [L597] List t; [L598] List p = a; VAL [a={-2:0}, n={-11:0}, p={-2:0}, pred={0:0}, root={0:0}] [L599] COND TRUE __VERIFIER_nondet_int() [L600] p->h = 1 [L601] t = (List) malloc(sizeof(struct node)) [L602] COND FALSE !(t == 0) VAL [a={-2:0}, n={-11:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L603] p->n = t [L604] EXPR p->n [L604] p = p->n [L599] COND FALSE !(__VERIFIER_nondet_int()) [L606] COND TRUE __VERIFIER_nondet_int() [L607] p->h = 2 [L608] t = (List) malloc(sizeof(struct node)) [L609] COND FALSE !(t == 0) VAL [a={-2:0}, n={-11:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-1:0}] [L610] p->n = t [L611] EXPR p->n [L611] p = p->n [L606] COND FALSE !(__VERIFIER_nondet_int()) [L613] p->h = 3 [L614] p = a VAL [a={-2:0}, n={-11:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-1:0}] [L615] EXPR p->h VAL [a={-2:0}, n={-11:0}, p={-2:0}, p->h=-1, pred={0:0}, root={0:0}, t={-1:0}] [L615] COND FALSE !(p->h == 2) [L617] EXPR p->h VAL [a={-2:0}, n={-11:0}, p={-2:0}, p->h=-1, pred={0:0}, root={0:0}, t={-1:0}] [L617] COND TRUE p->h == 1 [L618] EXPR p->n [L618] p = p->n [L617] EXPR p->h VAL [a={-2:0}, n={-11:0}, p={-3:0}, p->h=-2, pred={0:0}, root={0:0}, t={-1:0}] [L617] COND FALSE !(p->h == 1) [L619] EXPR p->h VAL [a={-2:0}, n={-11:0}, p={-3:0}, p->h=-2, pred={0:0}, root={0:0}, t={-1:0}] [L619] COND TRUE p->h != 3 [L620] reach_error() VAL [a={-2:0}, n={-11:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.8s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 920 mSDsluCounter, 5494 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1445 IncrementalHoareTripleChecker+Unchecked, 4711 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2631 IncrementalHoareTripleChecker+Invalid, 4487 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 783 mSDtfsCounter, 2631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 499 SyntacticMatches, 28 SemanticMatches, 367 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=13, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 256 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 28.6s InterpolantComputationTime, 790 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1018 ConstructedInterpolants, 85 QuantifiedInterpolants, 12115 SizeOfPredicates, 107 NumberOfNonLiveVariables, 4266 ConjunctsInSsa, 417 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 75/161 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 17:47:29,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...