/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/verifythis/prefixsum_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:35:59,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:35:59,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:36:00,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:36:00,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:36:00,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:36:00,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:36:00,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:36:00,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:36:00,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:36:00,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:36:00,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:36:00,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:36:00,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:36:00,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:36:00,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:36:00,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:36:00,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:36:00,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:36:00,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:36:00,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:36:00,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:36:00,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:36:00,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:36:00,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:36:00,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:36:00,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:36:00,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:36:00,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:36:00,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:36:00,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:36:00,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:36:00,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:36:00,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:36:00,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:36:00,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:36:00,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:36:00,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:36:00,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:36:00,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:36:00,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:36:00,068 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 14:36:00,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:36:00,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:36:00,103 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:36:00,103 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:36:00,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:36:00,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:36:00,104 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:36:00,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:36:00,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:36:00,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:36:00,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:36:00,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:36:00,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:36:00,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:36:00,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:36:00,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:36:00,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:36:00,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:36:00,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:36:00,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:36:00,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:36:00,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:36:00,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:36:00,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:36:00,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:36:00,112 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:36:00,112 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 14:36:00,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:36:00,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:36:00,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:36:00,372 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:36:00,372 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:36:00,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-01-10 14:36:00,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07f690b/68034de5d2004dea914595114da4bd66/FLAGb087836fe [2022-01-10 14:36:00,856 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:36:00,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c [2022-01-10 14:36:00,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07f690b/68034de5d2004dea914595114da4bd66/FLAGb087836fe [2022-01-10 14:36:01,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b07f690b/68034de5d2004dea914595114da4bd66 [2022-01-10 14:36:01,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:36:01,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:36:01,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:36:01,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:36:01,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:36:01,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442e3a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01, skipping insertion in model container [2022-01-10 14:36:01,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:36:01,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:36:01,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-01-10 14:36:01,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:36:01,475 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:36:01,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/prefixsum_iter.c[526,539] [2022-01-10 14:36:01,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:36:01,532 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:36:01,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01 WrapperNode [2022-01-10 14:36:01,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:36:01,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:36:01,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:36:01,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:36:01,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,588 INFO L137 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 136 [2022-01-10 14:36:01,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:36:01,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:36:01,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:36:01,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:36:01,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:36:01,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:36:01,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:36:01,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:36:01,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (1/1) ... [2022-01-10 14:36:01,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:36:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:01,673 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 14:36:01,692 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 14:36:01,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:36:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:36:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 14:36:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 14:36:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:36:01,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:36:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 14:36:01,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 14:36:01,812 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:36:01,814 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:36:02,096 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:36:02,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:36:02,102 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-10 14:36:02,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02 BoogieIcfgContainer [2022-01-10 14:36:02,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:36:02,104 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:36:02,104 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:36:02,106 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:36:02,109 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02" (1/1) ... [2022-01-10 14:36:02,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:36:02 BasicIcfg [2022-01-10 14:36:02,227 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:36:02,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:36:02,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:36:02,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:36:02,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:36:01" (1/4) ... [2022-01-10 14:36:02,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187bd55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:02, skipping insertion in model container [2022-01-10 14:36:02,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:01" (2/4) ... [2022-01-10 14:36:02,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187bd55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:02, skipping insertion in model container [2022-01-10 14:36:02,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:02" (3/4) ... [2022-01-10 14:36:02,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187bd55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:36:02, skipping insertion in model container [2022-01-10 14:36:02,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:36:02" (4/4) ... [2022-01-10 14:36:02,233 INFO L111 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.cTransformedIcfg [2022-01-10 14:36:02,237 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:36:02,238 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 14:36:02,275 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:36:02,281 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 14:36:02,281 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 14:36:02,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:36:02,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:02,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:02,305 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:02,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash 742652290, now seen corresponding path program 1 times [2022-01-10 14:36:02,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:02,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700967846] [2022-01-10 14:36:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:02,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:02,524 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 14:36:02,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:02,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700967846] [2022-01-10 14:36:02,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700967846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:02,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:02,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:36:02,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437385903] [2022-01-10 14:36:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:02,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 14:36:02,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 14:36:02,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 14:36:02,566 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:02,589 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2022-01-10 14:36:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 14:36:02,591 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 14:36:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:02,597 INFO L225 Difference]: With dead ends: 67 [2022-01-10 14:36:02,598 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 14:36:02,608 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 14:36:02,612 INFO L933 BasicCegarLoop]: 43 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, 43 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 14:36:02,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:36:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 14:36:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 14:36:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-01-10 14:36:02,650 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 23 [2022-01-10 14:36:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:02,651 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-01-10 14:36:02,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-01-10 14:36:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 14:36:02,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:02,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:02,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:36:02,654 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1342731011, now seen corresponding path program 1 times [2022-01-10 14:36:02,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397857454] [2022-01-10 14:36:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:02,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:03,409 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 14:36:03,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:03,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397857454] [2022-01-10 14:36:03,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397857454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:03,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:03,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 14:36:03,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281760761] [2022-01-10 14:36:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:03,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 14:36:03,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 14:36:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 14:36:03,413 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:03,817 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2022-01-10 14:36:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 14:36:03,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 14:36:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:03,819 INFO L225 Difference]: With dead ends: 53 [2022-01-10 14:36:03,819 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 14:36:03,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-01-10 14:36:03,821 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 119 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:03,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 54 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:36:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 14:36:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-01-10 14:36:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-01-10 14:36:03,832 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 23 [2022-01-10 14:36:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:03,834 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-01-10 14:36:03,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-01-10 14:36:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 14:36:03,843 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:03,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:03,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:36:03,844 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:03,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1996028901, now seen corresponding path program 1 times [2022-01-10 14:36:03,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:03,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379807190] [2022-01-10 14:36:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:03,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 14:36:04,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:04,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379807190] [2022-01-10 14:36:04,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379807190] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:04,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:04,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 14:36:04,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875874285] [2022-01-10 14:36:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:04,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:36:04,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:36:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:36:04,208 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:04,475 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-01-10 14:36:04,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:36:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 14:36:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:04,476 INFO L225 Difference]: With dead ends: 60 [2022-01-10 14:36:04,476 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 14:36:04,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-01-10 14:36:04,478 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:04,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 57 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:36:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 14:36:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-01-10 14:36:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 14:36:04,492 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 25 [2022-01-10 14:36:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:04,492 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 14:36:04,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 14:36:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 14:36:04,493 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:04,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:04,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:36:04,494 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash -405914394, now seen corresponding path program 1 times [2022-01-10 14:36:04,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:04,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619293205] [2022-01-10 14:36:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:04,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:36:05,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:05,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619293205] [2022-01-10 14:36:05,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619293205] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:05,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614595768] [2022-01-10 14:36:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:05,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:05,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:05,271 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 14:36:05,294 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 14:36:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:05,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 14:36:05,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:06,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 14:36:06,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 14:36:06,163 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 14:36:06,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 14:36:06,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 14:36:06,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 14:36:06,399 INFO L353 Elim1Store]: treesize reduction 65, result has 9.7 percent of original size [2022-01-10 14:36:06,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2022-01-10 14:36:06,506 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 32 treesize of output 20 [2022-01-10 14:36:06,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:36:06,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:36:08,644 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616))))) is different from false [2022-01-10 14:36:08,737 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616))))) (not (< (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648))) (+ (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648)) |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|)))) is different from false [2022-01-10 14:36:08,786 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) is different from false [2022-01-10 14:36:08,852 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_48 (Array Int Int)) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_48) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (v_ArrVal_48 (Array Int Int)) (v_ArrVal_49 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_48) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_49) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) is different from false [2022-01-10 14:36:09,084 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:09,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 92 [2022-01-10 14:36:09,101 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:09,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 176 [2022-01-10 14:36:09,111 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 191 treesize of output 187 [2022-01-10 14:36:09,149 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 190 treesize of output 186 [2022-01-10 14:36:09,695 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 10 treesize of output 4 [2022-01-10 14:36:11,682 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:11,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 170 [2022-01-10 14:36:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 14:36:12,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614595768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:36:12,638 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:36:12,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 29 [2022-01-10 14:36:12,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443548338] [2022-01-10 14:36:12,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:36:12,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 14:36:12,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 14:36:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=498, Unknown=5, NotChecked=196, Total=812 [2022-01-10 14:36:12,640 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:21,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 1 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|))) (and (or (<= |c_ULTIMATE.start_ULTIMATE.start_is_pow2_#res#1Int| 0) (and (<= |c_ULTIMATE.start_ULTIMATE.start_is_pow2_#res#1Int| 1) .cse0)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int|) .cse0 (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc15#1.baseInt|) 0) 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc15#1.offsetInt| 0) (or (<= |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 0) (and .cse0 (<= |c_ULTIMATE.start_ULTIMATE.start_assume_abort_if_not_~cond#1Int| 1))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_is_pow2_~x#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse2 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse2 4) (* 18446744056529682432 (mod (div .cse2 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc15#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 0) (= |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 0))) is different from false [2022-01-10 14:36:23,287 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_1| (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_1| 4294967295) 4294967296))) (+ (* .cse1 4) (* 18446744056529682432 (mod (div .cse1 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 0)) is different from false [2022-01-10 14:36:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:23,759 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-01-10 14:36:23,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 14:36:23,759 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 14:36:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:23,761 INFO L225 Difference]: With dead ends: 71 [2022-01-10 14:36:23,762 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 14:36:23,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=277, Invalid=1145, Unknown=8, NotChecked=462, Total=1892 [2022-01-10 14:36:23,763 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:23,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 302 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 284 Invalid, 0 Unknown, 229 Unchecked, 0.5s Time] [2022-01-10 14:36:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 14:36:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2022-01-10 14:36:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-01-10 14:36:23,779 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 27 [2022-01-10 14:36:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:23,779 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-01-10 14:36:23,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-01-10 14:36:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 14:36:23,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:23,780 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:23,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 14:36:23,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:23,986 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 880007432, now seen corresponding path program 2 times [2022-01-10 14:36:23,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:23,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809808113] [2022-01-10 14:36:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:23,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:36:24,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:24,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809808113] [2022-01-10 14:36:24,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809808113] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:24,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739685697] [2022-01-10 14:36:24,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 14:36:24,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:24,215 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 14:36:24,216 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 14:36:24,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 14:36:24,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 14:36:24,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-10 14:36:24,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:24,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-01-10 14:36:24,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 14:36:24,937 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:24,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 23 [2022-01-10 14:36:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 14:36:24,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 14:36:24,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739685697] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:24,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 14:36:24,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 18 [2022-01-10 14:36:24,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630304009] [2022-01-10 14:36:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:24,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 14:36:24,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:24,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 14:36:24,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-01-10 14:36:24,967 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:25,907 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-01-10 14:36:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 14:36:25,908 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 14:36:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:25,910 INFO L225 Difference]: With dead ends: 105 [2022-01-10 14:36:25,910 INFO L226 Difference]: Without dead ends: 103 [2022-01-10 14:36:25,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2022-01-10 14:36:25,912 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 237 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:25,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 202 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 14:36:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-10 14:36:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-01-10 14:36:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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 14:36:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2022-01-10 14:36:25,935 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 29 [2022-01-10 14:36:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:25,935 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2022-01-10 14:36:25,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2022-01-10 14:36:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 14:36:25,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:25,936 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:25,948 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 14:36:26,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:26,142 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -252916229, now seen corresponding path program 1 times [2022-01-10 14:36:26,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:26,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821192683] [2022-01-10 14:36:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:26,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 14:36:26,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:26,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821192683] [2022-01-10 14:36:26,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821192683] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:26,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381427943] [2022-01-10 14:36:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:26,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:26,271 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 14:36:26,299 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 14:36:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:26,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 14:36:26,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 14:36:27,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:36:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 14:36:27,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381427943] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:36:27,457 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:36:27,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 21 [2022-01-10 14:36:27,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698501593] [2022-01-10 14:36:27,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:36:27,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 14:36:27,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:27,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 14:36:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-01-10 14:36:27,460 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:28,730 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2022-01-10 14:36:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 14:36:28,731 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 14:36:28,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:28,732 INFO L225 Difference]: With dead ends: 134 [2022-01-10 14:36:28,732 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 14:36:28,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2022-01-10 14:36:28,734 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 382 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:28,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 383 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 14:36:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 14:36:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 61. [2022-01-10 14:36:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 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 14:36:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2022-01-10 14:36:28,767 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 30 [2022-01-10 14:36:28,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:28,768 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2022-01-10 14:36:28,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-01-10 14:36:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 14:36:28,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:28,774 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:28,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 14:36:28,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:28,979 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1390122208, now seen corresponding path program 1 times [2022-01-10 14:36:28,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:28,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153344036] [2022-01-10 14:36:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:28,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 14:36:29,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:29,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153344036] [2022-01-10 14:36:29,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153344036] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822019531] [2022-01-10 14:36:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:29,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:29,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:29,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:36:29,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 14:36:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:29,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 14:36:29,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:36:29,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:36:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:36:34,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822019531] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:36:34,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:36:34,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2022-01-10 14:36:34,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673593725] [2022-01-10 14:36:34,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:36:34,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 14:36:34,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 14:36:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=228, Unknown=1, NotChecked=0, Total=272 [2022-01-10 14:36:34,534 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:35,172 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2022-01-10 14:36:35,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 14:36:35,173 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 14:36:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:35,173 INFO L225 Difference]: With dead ends: 117 [2022-01-10 14:36:35,173 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 14:36:35,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=161, Invalid=594, Unknown=1, NotChecked=0, Total=756 [2022-01-10 14:36:35,175 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 172 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:35,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 250 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 149 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-01-10 14:36:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 14:36:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-01-10 14:36:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 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 14:36:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2022-01-10 14:36:35,201 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 31 [2022-01-10 14:36:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:35,202 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2022-01-10 14:36:35,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-01-10 14:36:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 14:36:35,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:35,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:35,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 14:36:35,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:35,426 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1620300835, now seen corresponding path program 1 times [2022-01-10 14:36:35,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:35,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049872558] [2022-01-10 14:36:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:35,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:35,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 14:36:35,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:35,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049872558] [2022-01-10 14:36:35,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049872558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:36:35,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:36:35,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:36:35,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616881852] [2022-01-10 14:36:35,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:36:35,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:36:35,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:35,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:36:35,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:36:35,567 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:35,672 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-01-10 14:36:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 14:36:35,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 14:36:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:35,673 INFO L225 Difference]: With dead ends: 94 [2022-01-10 14:36:35,673 INFO L226 Difference]: Without dead ends: 80 [2022-01-10 14:36:35,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:36:35,674 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:35,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:36:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-10 14:36:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-01-10 14:36:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 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 14:36:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-01-10 14:36:35,696 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 31 [2022-01-10 14:36:35,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:35,697 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-01-10 14:36:35,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:36:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-01-10 14:36:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 14:36:35,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:35,698 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:35,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:36:35,698 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:35,698 INFO L85 PathProgramCache]: Analyzing trace with hash -954412500, now seen corresponding path program 1 times [2022-01-10 14:36:35,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:35,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741356179] [2022-01-10 14:36:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:35,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 14:36:35,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:35,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741356179] [2022-01-10 14:36:35,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741356179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:35,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487155071] [2022-01-10 14:36:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:35,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:35,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:35,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:36:35,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 14:36:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:36,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-10 14:36:36,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:36:36,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 14:36:36,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 14:36:36,735 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 14:36:36,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 14:36:36,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 14:36:36,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 14:36:37,160 INFO L353 Elim1Store]: treesize reduction 77, result has 12.5 percent of original size [2022-01-10 14:36:37,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-01-10 14:36:37,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 14:36:37,315 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:37,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2022-01-10 14:36:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 14:36:37,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:36:39,444 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) is different from false [2022-01-10 14:36:39,528 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) (not (< (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648))) (+ (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648)) |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|)))) is different from false [2022-01-10 14:36:39,557 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))))) is different from false [2022-01-10 14:36:39,591 WARN L838 $PredicateComparison]: unable to prove that (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) is different from false [2022-01-10 14:36:39,733 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:39,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 92 [2022-01-10 14:36:39,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:39,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 176 [2022-01-10 14:36:39,749 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 191 treesize of output 187 [2022-01-10 14:36:39,756 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 190 treesize of output 186 [2022-01-10 14:36:39,789 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 10 treesize of output 4 [2022-01-10 14:36:45,061 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:36:45,062 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 222 [2022-01-10 14:36:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-01-10 14:36:45,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487155071] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:36:45,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:36:45,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 11] total 32 [2022-01-10 14:36:45,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37496054] [2022-01-10 14:36:45,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:36:45,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-10 14:36:45,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:36:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-10 14:36:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=650, Unknown=4, NotChecked=220, Total=992 [2022-01-10 14:36:45,534 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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 14:36:48,096 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_176 (Array Int Int))) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| v_ArrVal_176) |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (= |c_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#ptr#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) is different from false [2022-01-10 14:36:50,109 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt|)) (or (<= 0 (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (- 2) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648))) 4294967296)) (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_#t~malloc16#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|)) is different from false [2022-01-10 14:36:52,131 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt|)) (or (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int) (v_ArrVal_177 (Array Int Int))) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a0~0#1.baseInt| v_ArrVal_177) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) (not (< (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648))) (+ (* 2 (mod |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648)) |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int|)))) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 0)) is different from false [2022-01-10 14:36:54,137 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 4294967296) (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 1)) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) is different from false [2022-01-10 14:36:56,142 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= 0 (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse0) (* (mod (div .cse0 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (exists ((|v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| Int)) (and (<= 0 |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) (<= |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_#Ultimate.meminit_#t~loopctr21#1Int_10|) 18446744073709551616)) 0))) (<= 2 |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int|) (<= (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 1 (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| 2147483648) 4294967296)) (+ |c_ULTIMATE.start_ULTIMATE.start_main_~n~0#1Int| (* (div |c_ULTIMATE.start_ULTIMATE.start_main_~i~1#1Int| 2147483648) 4294967296))) (forall ((|v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| Int) (|v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4| Int)) (<= (select (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ (mod (let ((.cse1 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_downsweep_~n#1Int_4| 4294967295) 4294967296))) (+ (* 4 .cse1) (* (mod (div .cse1 2147483648) 2) 18446744056529682432))) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_downsweep_~a#1.offsetInt_4|) 18446744073709551616) 0) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 18446744073709551616)) 0))) is different from false [2022-01-10 14:36:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:36:56,489 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2022-01-10 14:36:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-10 14:36:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-01-10 14:36:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:36:56,490 INFO L225 Difference]: With dead ends: 151 [2022-01-10 14:36:56,490 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 14:36:56,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=244, Invalid=1343, Unknown=9, NotChecked=756, Total=2352 [2022-01-10 14:36:56,492 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 14:36:56,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 244 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 201 Unchecked, 0.4s Time] [2022-01-10 14:36:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 14:36:56,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2022-01-10 14:36:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.28) internal successors, (128), 100 states have internal predecessors, (128), 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 14:36:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2022-01-10 14:36:56,531 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 31 [2022-01-10 14:36:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:36:56,531 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2022-01-10 14:36:56,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 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 14:36:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-01-10 14:36:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 14:36:56,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:36:56,532 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:36:56,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-10 14:36:56,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:56,737 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:36:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:36:56,738 INFO L85 PathProgramCache]: Analyzing trace with hash 814515082, now seen corresponding path program 2 times [2022-01-10 14:36:56,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:36:56,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543213162] [2022-01-10 14:36:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:36:56,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:36:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:36:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 14:36:56,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:36:56,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543213162] [2022-01-10 14:36:56,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543213162] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:36:56,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971821356] [2022-01-10 14:36:56,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 14:36:56,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:36:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:36:56,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:36:56,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 14:36:57,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 14:36:57,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 14:36:57,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 14:36:57,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:37:02,720 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-01-10 14:37:03,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 14:37:03,890 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 14:37:03,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 23 [2022-01-10 14:37:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 14:37:03,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 14:37:03,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971821356] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:37:03,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 14:37:03,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2022-01-10 14:37:03,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304854504] [2022-01-10 14:37:03,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:37:03,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 14:37:03,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:37:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 14:37:03,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-01-10 14:37:03,948 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:37:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:37:06,627 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2022-01-10 14:37:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 14:37:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-01-10 14:37:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:37:06,629 INFO L225 Difference]: With dead ends: 120 [2022-01-10 14:37:06,629 INFO L226 Difference]: Without dead ends: 115 [2022-01-10 14:37:06,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=122, Invalid=689, Unknown=1, NotChecked=0, Total=812 [2022-01-10 14:37:06,630 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 56 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 14:37:06,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 189 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 30 Unchecked, 0.5s Time] [2022-01-10 14:37:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-10 14:37:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2022-01-10 14:37:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.276190476190476) internal successors, (134), 105 states have internal predecessors, (134), 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 14:37:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2022-01-10 14:37:06,677 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 33 [2022-01-10 14:37:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:37:06,678 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2022-01-10 14:37:06,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:37:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2022-01-10 14:37:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 14:37:06,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:37:06,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:37:06,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 14:37:06,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:37:06,881 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:37:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:37:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash 328827702, now seen corresponding path program 1 times [2022-01-10 14:37:06,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:37:06,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979138408] [2022-01-10 14:37:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:37:06,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:37:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:37:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 14:37:07,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:37:07,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979138408] [2022-01-10 14:37:07,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979138408] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:37:07,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795225322] [2022-01-10 14:37:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:37:07,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:37:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:37:07,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:37:07,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 14:37:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:37:07,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 14:37:07,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:37:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 14:37:07,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 14:37:07,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795225322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:37:07,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 14:37:07,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2022-01-10 14:37:07,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143110329] [2022-01-10 14:37:07,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:37:07,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 14:37:07,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:37:07,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 14:37:07,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 14:37:07,391 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 14:37:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:37:07,764 INFO L93 Difference]: Finished difference Result 119 states and 149 transitions. [2022-01-10 14:37:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 14:37:07,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 34 [2022-01-10 14:37:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:37:07,765 INFO L225 Difference]: With dead ends: 119 [2022-01-10 14:37:07,765 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 14:37:07,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-01-10 14:37:07,766 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 40 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 14:37:07,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 155 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 14:37:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 14:37:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-01-10 14:37:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:37:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2022-01-10 14:37:07,813 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 34 [2022-01-10 14:37:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:37:07,813 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2022-01-10 14:37:07,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 14:37:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2022-01-10 14:37:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 14:37:07,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:37:07,814 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:37:07,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0