/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/heap-data/shared_mem1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:51:16,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:51:16,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:51:16,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:51:16,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:51:16,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:51:16,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:51:16,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:51:16,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:51:16,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:51:16,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:51:16,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:51:16,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:51:16,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:51:16,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:51:16,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:51:16,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:51:16,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:51:16,940 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:51:16,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:51:16,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:51:16,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:51:16,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:51:16,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:51:16,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:51:16,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:51:16,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:51:16,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:51:16,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:51:16,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:51:16,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:51:16,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:51:16,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:51:16,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:51:16,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:51:16,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:51:16,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:51:16,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:51:16,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:51:16,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:51:16,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:51:16,963 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:51:16,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:51:16,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:51:16,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:51:16,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:51:16,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:51:16,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:51:16,995 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:51:16,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:51:16,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:51:16,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:51:16,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:51:16,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:51:16,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:51:16,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:51:16,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:51:16,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:51:16,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:51:16,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:51:16,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:51:16,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:51:16,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:51:16,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:51:16,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:51:16,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:51:16,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:51:16,999 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:51:17,000 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:51:17,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:51:17,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:51:17,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:51:17,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:51:17,210 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:51:17,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem1.i [2022-01-10 17:51:17,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e903047/4a8be7a1d65548a0bfebe643bcd11cab/FLAGec1c91397 [2022-01-10 17:51:17,638 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:51:17,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i [2022-01-10 17:51:17,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e903047/4a8be7a1d65548a0bfebe643bcd11cab/FLAGec1c91397 [2022-01-10 17:51:17,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3e903047/4a8be7a1d65548a0bfebe643bcd11cab [2022-01-10 17:51:17,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:51:17,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:51:17,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:51:17,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:51:17,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:51:17,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:51:17" (1/1) ... [2022-01-10 17:51:17,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ba022a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:17, skipping insertion in model container [2022-01-10 17:51:17,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:51:17" (1/1) ... [2022-01-10 17:51:17,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:51:17,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:51:18,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i[23879,23892] [2022-01-10 17:51:18,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:51:18,020 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:51:18,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i[23879,23892] [2022-01-10 17:51:18,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:51:18,070 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:51:18,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18 WrapperNode [2022-01-10 17:51:18,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:51:18,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:51:18,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:51:18,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:51:18,077 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:51:18" (1/1) ... [2022-01-10 17:51:18,093 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:51:18" (1/1) ... [2022-01-10 17:51:18,109 INFO L137 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-01-10 17:51:18,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:51:18,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:51:18,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:51:18,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:51:18,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:51:18,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:51:18,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:51:18,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:51:18,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:51:18,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:18,175 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:51:18,179 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:51:18,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:51:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:51:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:51:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:51:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:51:18,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:51:18,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:51:18,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:51:18,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:51:18,291 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:51:18,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:51:18,606 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:51:18,611 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:51:18,611 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 17:51:18,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:51:18 BoogieIcfgContainer [2022-01-10 17:51:18,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:51:18,613 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:51:18,613 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:51:18,614 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:51:18,616 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:51:18" (1/1) ... [2022-01-10 17:51:18,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:51:18 BasicIcfg [2022-01-10 17:51:18,703 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:51:18,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:51:18,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:51:18,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:51:18,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:51:17" (1/4) ... [2022-01-10 17:51:18,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ac8ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:51:18, skipping insertion in model container [2022-01-10 17:51:18,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:18" (2/4) ... [2022-01-10 17:51:18,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ac8ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:51:18, skipping insertion in model container [2022-01-10 17:51:18,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:51:18" (3/4) ... [2022-01-10 17:51:18,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ac8ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:51:18, skipping insertion in model container [2022-01-10 17:51:18,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:51:18" (4/4) ... [2022-01-10 17:51:18,715 INFO L111 eAbstractionObserver]: Analyzing ICFG shared_mem1.iTransformedIcfg [2022-01-10 17:51:18,733 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:51:18,734 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:51:18,789 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:51:18,794 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:51:18,795 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:51:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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:51:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 17:51:18,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:18,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:18,812 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash -945121398, now seen corresponding path program 1 times [2022-01-10 17:51:18,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:18,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520129076] [2022-01-10 17:51:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:18,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:19,092 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:51:19,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:19,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520129076] [2022-01-10 17:51:19,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520129076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:51:19,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:51:19,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:51:19,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806573015] [2022-01-10 17:51:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:51:19,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:51:19,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:19,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:51:19,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:51:19,137 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:51:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:19,151 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2022-01-10 17:51:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:51:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-01-10 17:51:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:19,158 INFO L225 Difference]: With dead ends: 26 [2022-01-10 17:51:19,159 INFO L226 Difference]: Without dead ends: 12 [2022-01-10 17:51:19,163 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:51:19,166 INFO L933 BasicCegarLoop]: 19 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, 19 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:51:19,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:51:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-01-10 17:51:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-01-10 17:51:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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:51:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-01-10 17:51:19,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2022-01-10 17:51:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:19,193 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-01-10 17:51:19,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:51:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-01-10 17:51:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 17:51:19,195 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:19,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:19,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:51:19,196 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:19,197 INFO L85 PathProgramCache]: Analyzing trace with hash 797688937, now seen corresponding path program 1 times [2022-01-10 17:51:19,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:19,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442995052] [2022-01-10 17:51:19,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:19,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:19,613 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:51:19,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:19,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442995052] [2022-01-10 17:51:19,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442995052] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:51:19,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:51:19,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 17:51:19,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356339955] [2022-01-10 17:51:19,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:51:19,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 17:51:19,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:19,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 17:51:19,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:51:19,617 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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:51:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:19,971 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-01-10 17:51:19,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:51:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2022-01-10 17:51:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:19,974 INFO L225 Difference]: With dead ends: 27 [2022-01-10 17:51:19,974 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 17:51:19,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 17:51:19,976 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:19,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 29 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 17:51:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 17:51:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-01-10 17:51:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 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:51:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2022-01-10 17:51:19,982 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 10 [2022-01-10 17:51:19,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:19,982 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-01-10 17:51:19,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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:51:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-01-10 17:51:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 17:51:19,983 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:19,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:19,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:51:19,983 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:19,984 INFO L85 PathProgramCache]: Analyzing trace with hash 797689898, now seen corresponding path program 1 times [2022-01-10 17:51:19,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:19,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088803682] [2022-01-10 17:51:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:19,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:20,220 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:51:20,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:20,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088803682] [2022-01-10 17:51:20,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088803682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:51:20,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:51:20,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:51:20,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45394349] [2022-01-10 17:51:20,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:51:20,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:51:20,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:20,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:51:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:51:20,225 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:51:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:20,377 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2022-01-10 17:51:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:51:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-01-10 17:51:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:20,378 INFO L225 Difference]: With dead ends: 32 [2022-01-10 17:51:20,378 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 17:51:20,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-10 17:51:20,379 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:20,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:51:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 17:51:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-01-10 17:51:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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:51:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-01-10 17:51:20,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 10 [2022-01-10 17:51:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:20,386 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-01-10 17:51:20,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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:51:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-01-10 17:51:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 17:51:20,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:20,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:20,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:51:20,387 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:20,389 INFO L85 PathProgramCache]: Analyzing trace with hash 798613419, now seen corresponding path program 1 times [2022-01-10 17:51:20,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:20,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598570145] [2022-01-10 17:51:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:20,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:20,760 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:51:20,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:20,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598570145] [2022-01-10 17:51:20,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598570145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:51:20,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:51:20,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 17:51:20,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526880012] [2022-01-10 17:51:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:51:20,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 17:51:20,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 17:51:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:51:20,764 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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:51:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:21,059 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-01-10 17:51:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:51:21,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2022-01-10 17:51:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:21,060 INFO L225 Difference]: With dead ends: 35 [2022-01-10 17:51:21,060 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 17:51:21,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:51:21,062 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:21,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 17:51:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 17:51:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-01-10 17:51:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 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:51:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-01-10 17:51:21,066 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 10 [2022-01-10 17:51:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:21,066 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-01-10 17:51:21,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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:51:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-01-10 17:51:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 17:51:21,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:21,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:21,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:51:21,068 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1308337781, now seen corresponding path program 1 times [2022-01-10 17:51:21,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:21,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797498171] [2022-01-10 17:51:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:21,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:21,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:21,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797498171] [2022-01-10 17:51:21,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797498171] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:21,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692255398] [2022-01-10 17:51:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:21,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:21,631 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:51:21,632 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:51:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:21,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 17:51:21,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:22,043 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-10 17:51:22,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 82 [2022-01-10 17:51:22,098 INFO L353 Elim1Store]: treesize reduction 54, result has 33.3 percent of original size [2022-01-10 17:51:22,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 100 [2022-01-10 17:51:22,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-01-10 17:51:22,191 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 17 treesize of output 15 [2022-01-10 17:51:22,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2022-01-10 17:51:22,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-01-10 17:51:22,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2022-01-10 17:51:22,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2022-01-10 17:51:22,469 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:51:22,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2022-01-10 17:51:22,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-01-10 17:51:22,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:22,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 17:51:22,641 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 17:51:22,642 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 18 treesize of output 20 [2022-01-10 17:51:22,828 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 63 treesize of output 39 [2022-01-10 17:51:22,833 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 51 treesize of output 27 [2022-01-10 17:51:22,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:22,909 INFO L353 Elim1Store]: treesize reduction 40, result has 57.9 percent of original size [2022-01-10 17:51:22,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 72 [2022-01-10 17:51:35,011 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:35,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 124 [2022-01-10 17:51:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:35,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:35,191 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 143 treesize of output 95 [2022-01-10 17:51:37,205 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_28 Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_28 (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_28)) (.cse2 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| 4) 18446744073709551616)))) (store .cse1 .cse2 (mod (+ (select .cse1 .cse2) (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) 4294967296)))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* (mod .cse0 2147483648) 2)) (+ (* 2 (mod 110 2147483648)) .cse0)))) is different from false [2022-01-10 17:51:37,215 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 108 treesize of output 68 [2022-01-10 17:51:39,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (or (not (<= 0 v_arrayElimCell_29)) (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_28 (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_28))) (store .cse1 v_arrayElimCell_29 (mod (+ (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) (select .cse1 v_arrayElimCell_29)) 4294967296)))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* 2 (mod .cse0 2147483648))) (+ .cse0 (* 2 (mod 110 2147483648))))))) is different from false [2022-01-10 17:51:41,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| Int)) (or (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_28 (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_28))) (store .cse1 v_arrayElimCell_29 (mod (+ (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|) (select .cse1 v_arrayElimCell_29)) 4294967296)))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* 2 (mod .cse0 2147483648))) (+ (* 2 (mod 110 2147483648)) .cse0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|)) (not (<= 0 v_arrayElimCell_29)))) is different from false [2022-01-10 17:51:43,711 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_277 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~n~0#1.baseInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| Int) (v_ArrVal_275 (Array Int Int))) (or (let ((.cse0 (select (select (let ((.cse1 (let ((.cse3 (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_main_~n~0#1.baseInt_1| v_ArrVal_275))) (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt| (store (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ 12 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) 18446744073709551616) v_ArrVal_277))))) (store .cse1 v_arrayElimCell_28 (let ((.cse2 (select .cse1 v_arrayElimCell_28))) (store .cse2 v_arrayElimCell_29 (mod (+ (select .cse2 v_arrayElimCell_29) (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|)) 4294967296))))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* 2 (mod .cse0 2147483648))) (+ .cse0 (* 2 (mod 110 2147483648))))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|)) (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~n~0#1.baseInt_1|) 2) 0)) (not (<= 0 v_arrayElimCell_29)))) is different from false [2022-01-10 17:51:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 17:51:43,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692255398] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:43,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:43,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-01-10 17:51:43,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640860130] [2022-01-10 17:51:43,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:43,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 17:51:43,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:43,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 17:51:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=129, Unknown=4, NotChecked=108, Total=306 [2022-01-10 17:51:43,922 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:51:46,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (and (= 100 .cse0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|)) (<= .cse0 100) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (let ((.cse4 (+ (* (- 18446744073709551616) (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4))) (or (not (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|)) (let ((.cse3 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|))) (and (not (<= (+ (div (+ (select (select |c_#memory_intInt| .cse1) .cse2) .cse3) 4294967296) 1) 0)) (= .cse3 1))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt| .cse2))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| Int)) (or (let ((.cse5 (select (select (store |c_#memory_intInt| v_arrayElimCell_28 (let ((.cse6 (select |c_#memory_intInt| v_arrayElimCell_28))) (store .cse6 v_arrayElimCell_29 (mod (+ (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|) (select .cse6 v_arrayElimCell_29)) 4294967296)))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* 2 (mod .cse5 2147483648))) (+ (* 2 (mod 110 2147483648)) .cse5))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|)) (not (<= 0 v_arrayElimCell_29)))))) is different from false [2022-01-10 17:51:48,273 WARN L838 $PredicateComparison]: unable to prove that (and (= 100 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| Int)) (or (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_28 (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_28))) (store .cse1 v_arrayElimCell_29 (mod (+ (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|) (select .cse1 v_arrayElimCell_29)) 4294967296)))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* 2 (mod .cse0 2147483648))) (+ (* 2 (mod 110 2147483648)) .cse0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_2|)) (not (<= 0 v_arrayElimCell_29))))) is different from false [2022-01-10 17:51:50,296 WARN L838 $PredicateComparison]: unable to prove that (and (= 100 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|)) (exists ((|ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| Int)) (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 1))) (forall ((v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int)) (or (not (<= 0 v_arrayElimCell_29)) (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_28 (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_28))) (store .cse1 v_arrayElimCell_29 (mod (+ (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) (select .cse1 v_arrayElimCell_29)) 4294967296)))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* 2 (mod .cse0 2147483648))) (+ .cse0 (* 2 (mod 110 2147483648))))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) is different from false [2022-01-10 17:51:52,382 WARN L838 $PredicateComparison]: unable to prove that (and (= 100 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|)) (forall ((v_arrayElimCell_28 Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_28 (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_28)) (.cse2 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| 4) 18446744073709551616)))) (store .cse1 .cse2 (mod (+ (select .cse1 .cse2) (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) 4294967296)))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ 110 (* (mod .cse0 2147483648) 2)) (+ (* 2 (mod 110 2147483648)) .cse0)))) (exists ((|ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| Int)) (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 1))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) (<= 0 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| 4) 18446744073709551616)))) is different from false [2022-01-10 17:51:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:52,485 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-01-10 17:51:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 17:51:52,485 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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 12 [2022-01-10 17:51:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:52,486 INFO L225 Difference]: With dead ends: 42 [2022-01-10 17:51:52,486 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 17:51:52,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=97, Invalid=167, Unknown=8, NotChecked=280, Total=552 [2022-01-10 17:51:52,488 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:52,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 60 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2022-01-10 17:51:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 17:51:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-01-10 17:51:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-01-10 17:51:52,494 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2022-01-10 17:51:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:52,494 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-01-10 17:51:52,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:51:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-01-10 17:51:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 17:51:52,494 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:52,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:52,512 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:51:52,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:52,700 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1308336820, now seen corresponding path program 1 times [2022-01-10 17:51:52,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:52,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123220484] [2022-01-10 17:51:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:52,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:53,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:53,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123220484] [2022-01-10 17:51:53,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123220484] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:53,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944354801] [2022-01-10 17:51:53,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:53,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:53,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:53,192 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:51:53,195 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:51:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:53,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-10 17:51:53,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:53,827 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-10 17:51:53,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 82 [2022-01-10 17:51:53,961 INFO L353 Elim1Store]: treesize reduction 54, result has 33.3 percent of original size [2022-01-10 17:51:53,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 100 [2022-01-10 17:51:53,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:53,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:53,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-01-10 17:51:54,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2022-01-10 17:51:54,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:54,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2022-01-10 17:51:54,312 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 38 treesize of output 36 [2022-01-10 17:51:54,381 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 0 case distinctions, treesize of input 75 treesize of output 74 [2022-01-10 17:51:54,427 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 5 treesize of output 3 [2022-01-10 17:51:54,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2022-01-10 17:51:54,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2022-01-10 17:51:54,620 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:51:54,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 17:51:54,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-01-10 17:51:54,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:54,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 17:51:54,909 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 17:51:54,910 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 18 treesize of output 20 [2022-01-10 17:51:55,273 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 87 treesize of output 55 [2022-01-10 17:51:55,280 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 55 treesize of output 31 [2022-01-10 17:51:55,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:55,406 INFO L353 Elim1Store]: treesize reduction 40, result has 57.9 percent of original size [2022-01-10 17:51:55,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 75 [2022-01-10 17:52:05,066 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:05,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 131 [2022-01-10 17:52:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:52:05,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:52:05,395 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 168 treesize of output 112 [2022-01-10 17:52:05,401 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 112 treesize of output 72 [2022-01-10 17:52:07,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_57))) (let ((.cse2 (select .cse1 v_arrayElimCell_58))) (or (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_57 (store .cse1 v_arrayElimCell_58 (mod (+ .cse2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) 4294967296))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ (* (mod 90 2147483648) 2) .cse0) (+ (* (mod .cse0 2147483648) 2) 90))) (not (<= 0 .cse2)))))) is different from false [2022-01-10 17:52:10,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| Int)) (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_57))) (let ((.cse2 (select .cse1 v_arrayElimCell_58))) (or (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_57 (store .cse1 v_arrayElimCell_58 (mod (+ .cse2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|)) 4294967296))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ (* (mod 90 2147483648) 2) .cse0) (+ 90 (* (mod .cse0 2147483648) 2)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|)) (not (<= 0 .cse2)))))) is different from false [2022-01-10 17:52:12,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~n~0#1.baseInt_3| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| Int) (v_ArrVal_417 Int) (v_ArrVal_420 (Array Int Int))) (let ((.cse2 (let ((.cse4 (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_main_~n~0#1.baseInt_3| v_ArrVal_420))) (store .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt| (store (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ 12 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) 18446744073709551616) v_ArrVal_417))))) (let ((.cse3 (select .cse2 v_arrayElimCell_57))) (let ((.cse0 (select .cse3 v_arrayElimCell_58))) (or (not (<= 0 .cse0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|)) (let ((.cse1 (select (select (store .cse2 v_arrayElimCell_57 (store .cse3 v_arrayElimCell_58 (mod (+ (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|) .cse0) 4294967296))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ (* (mod 90 2147483648) 2) .cse1) (+ 90 (* (mod .cse1 2147483648) 2)))) (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~n~0#1.baseInt_3|) 2) 0))))))) is different from false [2022-01-10 17:52:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 17:52:12,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944354801] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:52:12,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:52:12,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-01-10 17:52:12,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90525489] [2022-01-10 17:52:12,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:52:12,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 17:52:12,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:52:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 17:52:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=129, Unknown=3, NotChecked=78, Total=272 [2022-01-10 17:52:12,608 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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:52:14,784 WARN L838 $PredicateComparison]: unable to prove that (and (= 100 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| Int)) (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_57))) (let ((.cse2 (select .cse1 v_arrayElimCell_58))) (or (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_57 (store .cse1 v_arrayElimCell_58 (mod (+ .cse2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|)) 4294967296))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ (* (mod 90 2147483648) 2) .cse0) (+ 90 (* (mod .cse0 2147483648) 2)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|)) (not (<= 0 .cse2))))))) is different from false [2022-01-10 17:52:17,031 WARN L838 $PredicateComparison]: unable to prove that (and (= 100 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| Int)) (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_57))) (let ((.cse2 (select .cse1 v_arrayElimCell_58))) (or (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_57 (store .cse1 v_arrayElimCell_58 (mod (+ .cse2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|)) 4294967296))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ (* (mod 90 2147483648) 2) .cse0) (+ 90 (* (mod .cse0 2147483648) 2)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt_5|)) (not (<= 0 .cse2))))))) is different from false [2022-01-10 17:52:19,050 WARN L838 $PredicateComparison]: unable to prove that (and (= 100 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|)) (exists ((|ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| Int)) (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 1))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_57 Int)) (let ((.cse1 (select |c_#memory_intInt| v_arrayElimCell_57))) (let ((.cse2 (select .cse1 v_arrayElimCell_58))) (or (let ((.cse0 (select (select (store |c_#memory_intInt| v_arrayElimCell_57 (store .cse1 v_arrayElimCell_58 (mod (+ .cse2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)) 4294967296))) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~m~0#1.offsetInt|))) (< (+ (* (mod 90 2147483648) 2) .cse0) (+ (* (mod .cse0 2147483648) 2) 90))) (not (<= 0 .cse2))))))) is different from false [2022-01-10 17:52:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:52:19,132 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-01-10 17:52:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 17:52:19,132 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 17:52:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:52:19,133 INFO L225 Difference]: With dead ends: 46 [2022-01-10 17:52:19,133 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 17:52:19,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=80, Invalid=148, Unknown=6, NotChecked=186, Total=420 [2022-01-10 17:52:19,134 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:52:19,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2022-01-10 17:52:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 17:52:19,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-01-10 17:52:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:52:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-01-10 17:52:19,141 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 12 [2022-01-10 17:52:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:52:19,141 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-01-10 17:52:19,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 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:52:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-01-10 17:52:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 17:52:19,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:52:19,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:52:19,151 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:52:19,343 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,SelfDestructingSolverStorable5 [2022-01-10 17:52:19,343 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:52:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:52:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1307414260, now seen corresponding path program 1 times [2022-01-10 17:52:19,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:52:19,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853469933] [2022-01-10 17:52:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:52:19,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:52:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:52:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:52:20,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:52:20,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853469933] [2022-01-10 17:52:20,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853469933] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:52:20,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695431039] [2022-01-10 17:52:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:52:20,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:52:20,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:52:20,028 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:52:20,037 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:52:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:52:20,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-10 17:52:20,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:52:20,527 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:52:20,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 17:52:20,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-01-10 17:52:20,585 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 0 case distinctions, treesize of input 34 treesize of output 34 [2022-01-10 17:52:20,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-01-10 17:52:20,618 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 8 treesize of output 7 [2022-01-10 17:52:20,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-01-10 17:52:20,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:52:20,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 17:52:20,879 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 17:52:20,879 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 18 treesize of output 20 [2022-01-10 17:52:21,155 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 67 treesize of output 43 [2022-01-10 17:52:21,164 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 43 treesize of output 27 [2022-01-10 17:52:21,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:52:21,422 INFO L353 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2022-01-10 17:52:21,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 76